An overview on polynomial approximation of NP-hard problems

The fact that polynomial time algorithm is very unlikely to be devised for an optimal solving of the NP-hard problems strongly motivates both the researchers and the practitioners to try to solve such problems heuristically, by making a trade-off between computational time and solution's qualit...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Yugoslav Journal of Operations Research Ročník 19; číslo 1; s. 3 - 40
Hlavní autor: Paschos, Vangelis
Médium: Journal Article
Jazyk:angličtina
Vydáno: University of Belgrade 2009
Témata:
approximation algorithms
computational complexity
ISSN:0354-0243, 1820-743X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract The fact that polynomial time algorithm is very unlikely to be devised for an optimal solving of the NP-hard problems strongly motivates both the researchers and the practitioners to try to solve such problems heuristically, by making a trade-off between computational time and solution's quality. In other words, heuristic computation consists of trying to find not the best solution but one solution which is 'close to' the optimal one in reasonable time. Among the classes of heuristic methods for NP-hard problems, the polynomial approximation algorithms aim at solving a given NP-hard problem in poly-nomial time by computing feasible solutions that are, under some predefined criterion, as near to the optimal ones as possible. The polynomial approximation theory deals with the study of such algorithms. This survey first presents and analyzes time approximation algorithms for some classical examples of NP-hard problems. Secondly, it shows how classical notions and tools of complexity theory, such as polynomial reductions, can be matched with polynomial approximation in order to devise structural results for NP-hard optimization problems. Finally, it presents a quick description of what is commonly called inapproximability results. Such results provide limits on the approximability of the problems tackled.
AbstractList The fact that polynomial time algorithm is very unlikely to be devised for an optimal solving of the NP-hard problems strongly motivates both the researchers and the practitioners to try to solve such problems heuristically, by making a trade-off between computational time and solution's quality. In other words, heuristic computation consists of trying to find not the best solution but one solution which is 'close to' the optimal one in reasonable time. Among the classes of heuristic methods for NP-hard problems, the polynomial approximation algorithms aim at solving a given NP-hard problem in poly-nomial time by computing feasible solutions that are, under some predefined criterion, as near to the optimal ones as possible. The polynomial approximation theory deals with the study of such algorithms. This survey first presents and analyzes time approximation algorithms for some classical examples of NP-hard problems. Secondly, it shows how classical notions and tools of complexity theory, such as polynomial reductions, can be matched with polynomial approximation in order to devise structural results for NP-hard optimization problems. Finally, it presents a quick description of what is commonly called inapproximability results. Such results provide limits on the approximability of the problems tackled.
Author Paschos, Vangelis
Author_xml – sequence: 1
  givenname: Vangelis
  surname: Paschos
  fullname: Paschos, Vangelis
  organization: LAMSADE, CNRS UMR and University Paris-Dauphine Place du Maréchal de Lattre de Tassigny, France
BookMark eNptkN1KAzEQhYNUsNbe-QD7AK5O_jYJXpXiT0VsEQW9WpJNopHtZsmWat_etRUR8WrgzJlvDucQDZrYOISOMZwSouTZ8838HhRgALrYQ0MsCeSC0acBGgLlLAfC6AEad10wgAWVknA5ROeTJotrl9bBvWexydpYb5q4DLrOdNum-BGWehX6RfTZ3SJ_1clmvWxqt-yO0L7XdefG33OEHi8vHqbX-e38ajad3OYV4azNhXcMmJHgDAMnFC4EEYpaMFRhXFDMnZGsMJYRLBXxwAtuDVaMVEXhraMjNNtxbdRvZZv6SGlTRh3KrRDTS6nTKlS1K6kHqoAzD84zprESllcW9z-sEISynnWyY1Updl1y_oeHofzqsfzdY28nf-xVWG0LWSUd6v-PPgHW_XXd
CitedBy_id crossref_primary_10_1016_j_ejor_2012_11_040
crossref_primary_10_1109_TPDS_2019_2961905
crossref_primary_10_1016_j_iot_2025_101740
crossref_primary_10_1016_j_cie_2021_107773
crossref_primary_10_3390_axioms14080605
crossref_primary_10_1016_j_ejor_2023_05_006
crossref_primary_10_1109_TCSI_2024_3411407
crossref_primary_10_1016_j_jocs_2021_101388
crossref_primary_10_1109_TVLSI_2024_3480958
crossref_primary_10_1155_2019_4034258
crossref_primary_10_3390_math9141599
Cites_doi 10.1007/BF01580444
10.1145/254180.254190
10.1016/j.ejor.2005.06.006
10.1016/0020-0190(93)90173-7
10.1137/S0097539796302531
10.1016/0012-365X(75)90058-8
10.1016/0022-0000(91)90023-X
10.1017/S030500410002168X
10.1016/0020-0190(94)00113-8
10.1145/321906.321909
10.1016/0022-0000(80)90046-X
10.1016/0304-3975(95)00060-7
10.1007/s10951-006-0003-7
10.1007/s00224-004-1162-6
10.1007/BF00290149
10.1137/S0097539795286612
10.1016/0095-8956(75)90089-1
10.1016/S0893-9659(97)00044-X
10.1007/BF02392825
10.1287/opre.6.6.791
10.1016/S0377-2217(02)00222-9
10.1287/moor.4.3.233
10.1016/j.tcs.2004.12.022
10.1016/0020-0190(93)90246-6
10.1016/S0377-2217(02)00299-0
10.1137/0403025
10.1016/0166-218X(83)90080-X
10.1016/0196-6774(80)90002-4
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.2298/YJOR0901003P
DatabaseName CrossRef
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals (WRLC)
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
EISSN 1820-743X
EndPage 40
ExternalDocumentID oai_doaj_org_article_3f039054f0ef44a197d5cd1315d77234
10_2298_YJOR0901003P
GroupedDBID AAYXX
ABJBX
CITATION
GROUPED_DOAJ
ID FETCH-LOGICAL-c254p-7fe404b80eb40e791672793d0b39116315eb846bd421892f0565db1942c66fde3
IEDL.DBID DOA
ISSN 0354-0243
IngestDate Fri Oct 03 12:40:43 EDT 2025
Sat Nov 29 03:15:43 EST 2025
Tue Nov 18 21:49:16 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
License http://creativecommons.org/licenses/by-nc-sa/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c254p-7fe404b80eb40e791672793d0b39116315eb846bd421892f0565db1942c66fde3
OpenAccessLink https://doaj.org/article/3f039054f0ef44a197d5cd1315d77234
PageCount 38
ParticipantIDs doaj_primary_oai_doaj_org_article_3f039054f0ef44a197d5cd1315d77234
crossref_primary_10_2298_YJOR0901003P
crossref_citationtrail_10_2298_YJOR0901003P
PublicationCentury 2000
PublicationDate 2009-00-00
2009-01-01
PublicationDateYYYYMMDD 2009-01-01
PublicationDate_xml – year: 2009
  text: 2009-00-00
PublicationDecade 2000
PublicationTitle Yugoslav Journal of Operations Research
PublicationYear 2009
Publisher University of Belgrade
Publisher_xml – name: University of Belgrade
References 22
23
24
25
26
27
28
10
11
12
13
14
15
16
17
18
19
1
2
3
4
5
6
7
8
9
20
21
References_xml – ident: 25
  doi: 10.1007/BF01580444
– ident: 27
  doi: 10.1145/254180.254190
– ident: 3
  doi: 10.1016/j.ejor.2005.06.006
– ident: 14
  doi: 10.1016/0020-0190(93)90173-7
– ident: 6
  doi: 10.1137/S0097539796302531
– ident: 21
  doi: 10.1016/0012-365X(75)90058-8
– ident: 26
  doi: 10.1016/0022-0000(91)90023-X
– ident: 7
  doi: 10.1017/S030500410002168X
– ident: 16
  doi: 10.1016/0020-0190(94)00113-8
– ident: 19
  doi: 10.1145/321906.321909
– ident: 2
  doi: 10.1016/0022-0000(80)90046-X
– ident: 11
  doi: 10.1016/0304-3975(95)00060-7
– ident: 10
  doi: 10.1007/s10951-006-0003-7
– ident: 13
  doi: 10.1007/s00224-004-1162-6
– ident: 23
  doi: 10.1007/BF00290149
– ident: 20
  doi: 10.1137/S0097539795286612
– ident: 22
  doi: 10.1016/0095-8956(75)90089-1
– ident: 12
  doi: 10.1016/S0893-9659(97)00044-X
– ident: 17
  doi: 10.1007/BF02392825
– ident: 9
  doi: 10.1287/opre.6.6.791
– ident: 24
  doi: 10.1016/S0377-2217(02)00222-9
– ident: 8
  doi: 10.1287/moor.4.3.233
– ident: 4
  doi: 10.1016/j.tcs.2004.12.022
– ident: 15
  doi: 10.1016/0020-0190(93)90246-6
– ident: 5
  doi: 10.1016/S0377-2217(02)00299-0
– ident: 28
  doi: 10.1137/0403025
– ident: 18
  doi: 10.1016/0166-218X(83)90080-X
– ident: 1
  doi: 10.1016/0196-6774(80)90002-4
SSID ssib017388258
ssib048656891
ssib044765231
Score 1.8678925
SecondaryResourceType review_article
Snippet The fact that polynomial time algorithm is very unlikely to be devised for an optimal solving of the NP-hard problems strongly motivates both the researchers...
SourceID doaj
crossref
SourceType Open Website
Enrichment Source
Index Database
StartPage 3
SubjectTerms approximation algorithms
computational complexity
Title An overview on polynomial approximation of NP-hard problems
URI https://doaj.org/article/3f039054f0ef44a197d5cd1315d77234
Volume 19
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1820-743X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044765231
  issn: 0354-0243
  databaseCode: M~E
  dateStart: 0
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3PS8MwFA4iHryIouL8RQ56krK0eW0SPE3ZENE5RGWeStImMBjd2Kboxb_dl7bOehAvXkopj9K-F_K-L3n5HiEnItMCcYgObOJXq2K80xKJq3HGevKT6bLK9-lG9PtyOFSDRqsvXxNWyQNXjmtzx5CWx-CYdQA6VCKPszzkYZwjMOSlEigTqkGmcCSFgiNy_N7vAxBJ3NjvAokwpm6nx2MIvCxfVRUfRUq2n6_v7pmvW2B88CNfNWT9y_zT2yQbNXCkneqDt8iKLbbJeaegvgbTr-_TSUGnk_G7P2eMhqVY-NuoOplIJ472B4E_YUXrFjLzHfLY6z5cXgV1O4QgQxY3DYSzwMBIZg0wKxDXIfZQPGeG44yVoEesQTRhcsC0rSKH0CbOTaggypLE5ZbvktViUtg9Qo1TOWgHOLs4JHhcAzdORw5smEgnZYucff10mtVa4b5lxThFzuBdlDZd1CKnS-tppZHxi92F99_Sxitblw8w3mkd7_SveO__x0sOyHq1K-SXUg7J6mL2Yo_IWva6GM1nx-VQwuvtR_cT0zPGow
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+overview+on+polynomial+approximation+of+NP-hard+problems&rft.jtitle=Yugoslav+Journal+of+Operations+Research&rft.au=Paschos%2C+Vangelis&rft.date=2009&rft.issn=0354-0243&rft.eissn=1820-743X&rft.volume=19&rft.issue=1&rft.spage=3&rft.epage=40&rft_id=info:doi/10.2298%2FYJOR0901003P&rft.externalDBID=n%2Fa&rft.externalDocID=10_2298_YJOR0901003P
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0354-0243&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0354-0243&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0354-0243&client=summon