Applications of Discrepancy Theory in Multiobjective Approximation
Data Structures and Algorithms
2011-07-05 v1 Computational Complexity
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.
Keywords
Cite
@article{arxiv.1107.0634,
title = {Applications of Discrepancy Theory in Multiobjective Approximation},
author = {Christian Glaßer and Christian Reitwießner and Maximilian Witek},
journal= {arXiv preprint arXiv:1107.0634},
year = {2011}
}