License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2011.55
URN: urn:nbn:de:0030-drops-33233
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2011/3323/
Glaßer, Christian ;
Reitwießner, Christian ;
Witek, Maximilian
Applications of Discrepancy Theory in Multiobjective Approximation
Abstract
We apply a multi-color extension of the Beck-Fiala theorem to show that the multiobjective maximum traveling salesman problem is randomized 1/2-approximable on directed graphs and randomized 2/3-approximable on undirected graphs. Using the same technique we show that the multiobjective maximum satisfiablilty problem is 1/2-approximable.
BibTeX - Entry
@InProceedings{glaer_et_al:LIPIcs:2011:3323,
author = {Christian Gla{\ss}er and Christian Reitwie{\ss}ner and Maximilian Witek},
title = {{Applications of Discrepancy Theory in Multiobjective Approximation }},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {55--65},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Supratik Chakraborty and Amit Kumar},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3323},
URN = {urn:nbn:de:0030-drops-33233},
doi = {10.4230/LIPIcs.FSTTCS.2011.55},
annote = {Keywords: Discrepancy Theory, Multiobjective Optimization, Satisfiability, Traveling Salesman}
}
Keywords: |
|
Discrepancy Theory, Multiobjective Optimization, Satisfiability, Traveling Salesman |
Collection: |
|
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011) |
Issue Date: |
|
2011 |
Date of publication: |
|
01.12.2011 |