STACS 2010 - PDF Preprint Papers

STACS 2010 Annual Symposium on Theoretical Aspects of Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed STACS-2010 Paper

click to vote

STACS
2010
Springer

129views Theoretical Computer Science» more STACS 2010»

The Traveling Salesman Problem under Squared Euclidean Distances

2 years 10 days ago

Download www1.informatik.uni-wuerzburg.de

The Traveling Salesman Problem Under Squared Euclidean Distances

Fred van Nijnatten, René Sitters, Gerhard J...

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	129	The Traveling Salesman Problem under Squared Euclidean Distances	claim
2	117	Optimal Query Complexity for Reconstructing Hypergraphs	claim
3	113	Robust Fault Tolerant Uncapacitated Facility Location	claim
4	113	AMS Without 4-Wise Independence on Product Domains	claim
5	101	Unsatisfiable Linear CNF Formulas Are Large and Complex	claim
6	95	Planar Subgraph Isomorphism Revisited	claim
7	95	Evasiveness and the Distribution of Prime Numbers	claim
8	93	Construction Sequences and Certifying 3-Connectedness	claim
9	90	Large-Girth Roots of Graphs	claim
10	89	Two-phase Algorithms for the Parametric Shortest Path Problem	claim
11	84	On Iterated Dominance, Matrix Elimination, and Matched Paths	claim
12	83	Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation	claim
13	81	Dispersion in Unit Disks	claim
14	77	Holant Problems for Regular Graphs with Complex Edge Functions	claim
15	77	Exact Covers via Determinants	claim
16	77	Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion	claim
17	76	Ultimate Traces of Cellular Automata	claim
18	76	The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets	claim
19	75	Mathematics, Cryptology, Security	claim
20	74	Reflections on Multivariate Algorithmics and Problem Parameterization	claim
21	74	Quantum Algorithms for Testing Properties of Distributions	claim
22	73	Evolving Multialgebras Unify All Usual Sequential Computation Models	claim
23	72	On Equations over Sets of Integers	claim
24	72	Intrinsic Universality in Self-Assembly	claim
25	70	Log-space Algorithms for Paths and Matchings in k-trees	claim
26	69	The Complexity of Approximating Bounded-Degree Boolean #CSP	claim
27	69	Relaxed Spanners for Directed Disk Graphs	claim
28	69	Collapsible Pushdown Graphs of Level 2 are Tree-Automatic	claim
29	68	Long Non-crossing Configurations in the Plane	claim
30	68	Named Models in Coalgebraic Hybrid Logic	claim
31	67	Sponsored Search, Market Equilibria, and the Hungarian Method	claim
32	67	An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem	claim
33	66	Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses	claim
34	66	Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window	claim
35	65	The Recognition of Tolerance and Bounded Tolerance Graphs	claim
36	64	Finding Induced Subgraphs via Minimal Triangulations	claim
37	63	Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs	claim
38	62	The Tropical Double Description Method	claim
39	62	Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs	claim
40	62	The Complexity of the List Homomorphism Problem for Graphs	claim
41	61	Branching-time Model Checking of One-counter Processes	claim
42	60	Online Correlation Clustering	claim
43	60	Decidability of the Interval Temporal Logic ABB over the Natural Numbers	claim
44	60	Inseparability and Strong Hypotheses for Disjoint NP Pairs	claim
45	59	Computing Least Fixed Points of Probabilistic Systems of Polynomials	claim
46	57	Alternation-Trading Proofs, Linear Programming, and Lower Bounds	claim
47	57	A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem	claim
48	57	Revisiting the Rice Theorem of Cellular Automata	claim
49	57	Treewidth Reduction for Constrained Separation and Bipartization Problems	claim
50	56	On Optimal Heuristic Randomized Semidecision Procedures, with Application to Proof Complexity	claim
51	56	Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs	claim
52	56	Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model	claim
53	56	The k-in-a-path Problem for Claw-free Graphs	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers