Computer Science – Data Structures and Algorithms
Scientific paper
2011-07-04
Computer Science
Data Structures and Algorithms
Scientific paper
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.
Glaßer Christian
Reitwießner Christian
Witek Maximilian
No associations
LandOfFree
Applications of Discrepancy Theory in Multiobjective Approximation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Applications of Discrepancy Theory in Multiobjective Approximation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Applications of Discrepancy Theory in Multiobjective Approximation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-4274