Approximation Algorithms for NP-Hard Problems

Simple item page
dc.bibliographicCitation.firstPage1461
dc.bibliographicCitation.lastPage1540
dc.bibliographicCitation.seriesTitleOberwolfach reports : OWReng
dc.bibliographicCitation.volume28
dc.contributor.otherKarpinski, Marek
dc.contributor.otherPrömel, Hans Jürgen
dc.date.accessioned2023-12-14T13:07:33Z
dc.date.available2023-12-14T13:07:33Z
dc.date.issued2004
dc.description.abstractThe workshop was concerned with the most important recent developments in the area of efficient approximation algorithms for NP-hard optimization problems as well as with new techniques for proving intrinsic lower bounds for efficient approximation.eng
dc.description.versionpublishedVersion
dc.identifier.urihttps://oa.tib.eu/renate/handle/123456789/12554
dc.identifier.urihttps://doi.org/10.34657/11584
dc.language.isoeng
dc.publisherZürich : EMS Publ. Houseeng
dc.relation.doihttps://doi.org/10.14760/OWR-2004-28
dc.relation.essn1660-8941
dc.relation.issn1660-8933
dc.rights.licenseDieses Dokument darf im Rahmen von § 53 UrhG zum eigenen Gebrauch kostenfrei heruntergeladen, gelesen, gespeichert und ausgedruckt, aber nicht im Internet bereitgestellt oder an Außenstehende weitergegeben werden.ger
dc.rights.licenseThis document may be downloaded, read, stored and printed for your own use within the limits of § 53 UrhG but it may not be distributed via the internet or passed on to external parties.eng
dc.subjectKonferenzschriftger
dc.subject.ddc510
dc.titleApproximation Algorithms for NP-Hard Problemseng
dc.typearticleeng
dc.typeTexteng
tib.accessRightsopenAccess
tib.relation.conferenceWorkshop Approximation Algorithms for NP-Hard Problems, 06 Jun - 12 Jun 2004, Oberwolfach
wgl.contributorMFO
wgl.subjectMathematik
wgl.typeZeitschriftenartikel
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
OWR_2004_28.pdf
Size:
669.19 KB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Mathematik
Oberwolfach Reports (OWR)