Treffer: Approximation Algorithms for Combinatorial Multicriteria Optimization Problems
Title:
Approximation Algorithms for Combinatorial Multicriteria Optimization Problems
Authors:
Document Type:
E-Ressource
Electronic Resource
Index Terms:
Availability:
Open access content. Open access content
Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011
https://kluedo.ub.rptu.de/download/lizenzen/kluedo_leitlinien_vor_2011-05-27.pdf
info:eu-repo/semantics/openAccess
Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011
https://kluedo.ub.rptu.de/download/lizenzen/kluedo_leitlinien_vor_2011-05-27.pdf
info:eu-repo/semantics/openAccess
Note:
English
Other Numbers:
UK@ oai:kluedo.ub.rptu.de:512
https://kluedo.ub.rptu.de/frontdoor/index/index/docId/512
urn:nbn:de:hbz:386-kluedo-4818
https://nbn-resolving.org/urn:nbn:de:hbz:386-kluedo-4818
https://kluedo.ub.rptu.de/files/512/gelb_39.pdf
1374232644
https://kluedo.ub.rptu.de/frontdoor/index/index/docId/512
urn:nbn:de:hbz:386-kluedo-4818
https://nbn-resolving.org/urn:nbn:de:hbz:386-kluedo-4818
https://kluedo.ub.rptu.de/files/512/gelb_39.pdf
1374232644
Contributing Source:
UNIVERSITATSBIBLIOTHEK KAISERSLAUTERN
From OAIster®, provided by the OCLC Cooperative.
From OAIster®, provided by the OCLC Cooperative.
Accession Number:
edsoai.on1374232644
Database:
OAIster
Weitere Informationen
The computational complexity of combinatorial multiple objective programming problems is investigated. NP-completeness and #P-completeness results are presented. Using two definitions of approximability, general results are presented, which outline limits for approximation algorithms. The performance of the well known tree and Christofides' heuristics for the TSP is investigated in the multicriteria case with respect to the two definitions of approximability.