STACS 2009 - PDF Preprint Papers

STACS 2009 Annual Symposium on Theoretical Aspects of Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed STACS-2009 Paper

click to vote

STACS
2009
Springer

168views Theoretical Computer Science» more STACS 2009»

On Approximating Multi-Criteria TSP

13 years 11 months ago

Download drops.dagstuhl.de

Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...

Bodo Manthey

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	168	On Approximating Multi-Criteria TSP	claim
2	157	Forward Analysis for WSTS, Part I: Completions	claim
3	152	Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs	claim
4	149	The Price of Anarchy in Cooperative Network Creation Games	claim
5	144	Approximating Acyclicity Parameters of Sparse Hypergraphs	claim
6	143	Computing Graph Roots Without Short Cycles	claim
7	142	Generating Shorter Bases for Hard Random Lattices	claim
8	141	The Dynamic Complexity of Formal Languages	claim
9	140	A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression	claim
10	139	A Comparison of Techniques for Sampling Web Pages	claim
11	137	Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness	claim
12	135	More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries	claim
13	130	Quantum Query Complexity of Multilinear Identity Testing	claim
14	127	Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties	claim
15	124	A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints	claim
16	123	A Generalization of Nemhauser and Trotter's Local Optimization Theorem	claim
17	121	On Local Symmetries and Universality in Cellular Automata	claim
18	118	Profinite Methods in Automata Theory	claim
19	117	Lower Bounds for Multi-Pass Processing of Multiple Data Streams	claim
20	116	Strong Completeness of Coalgebraic Modal Logics	claim
21	115	On the Average Complexity of Moore's State Minimization Algorithm	claim
22	114	Economical Caching	claim
23	111	Testing Linear-Invariant Non-Linear Properties	claim
24	111	Error-Correcting Data Structures	claim
25	111	Fragments of First-Order Logic over Infinite Words	claim
26	107	Undecidable Properties of Limit Set Dynamics of Cellular Automata	claim
27	107	Improved Approximations for Guarding 1.5-Dimensional Terrains	claim
28	107	Shortest Paths Avoiding Forbidden Subpaths	claim
29	104	Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence	claim
30	104	Cover Time and Broadcast Time	claim
31	103	On the Borel Inseparability of Game Tree Languages	claim
32	102	Optimal Cache-Aware Suffix Selection	claim
33	101	Locally Decodable Quantum Codes	claim
34	101	Semi-Online Preemptive Scheduling: One Algorithm for All Variants	claim
35	100	Ambiguity and Communication	claim
36	100	Qualitative Reachability in Stochastic BPA Games	claim
37	98	Reverse Engineering Prefix Tables	claim
38	98	Weak MSO with the Unbounding Quantifier	claim
39	97	Enumerating Homomorphisms	claim
40	95	Hardness and Algorithms for Rainbow Connectivity	claim
41	95	Randomness on Computable Probability Spaces - A Dynamical Point of View	claim
42	94	Tractable Structures for Constraint Satisfaction with Truth Tables	claim
43	93	Nonclairvoyant Speed Scaling for Flow and Energy	claim
44	90	Compressed Representations of Permutations, and Applications	claim
45	89	Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata	claim
46	87	A Polynomial Kernel for Multicut in Trees	claim
47	83	A Complexity Dichotomy for Partition Functions with Mixed Signs	claim
48	78	Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves	claim
49	77	Equations over Sets of Natural Numbers with Addition Only	claim
50	66	An Order on Sets of Tilings Corresponding to an Order on Languages	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers