Generating random combinatorial objects
Journal of Algorithms
The random walk construction of uniform spanning trees and uniform labelled trees
SIAM Journal on Discrete Mathematics
Two algorithms for unranking arborescences
Journal of Algorithms
Generating random spanning trees more quickly than the cover time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
SIAM Journal on Computing
Global min-cuts in RNC, and other ramifications of a simple min-out algorithm
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A new approximation algorithm for the asymmetric TSP with triangle inequality
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
Journal of the ACM (JACM)
Minimum Bounded Degree Spanning Trees
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
On the Integrality Ratio for the Asymmetric Traveling Salesman Problem
Mathematics of Operations Research
Minimizing Effective Resistance of a Graph
SIAM Review
Generating random spanning trees
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Faster Generation of Random Spanning Trees
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Asymmetric traveling salesman path and directed latency problems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms for the bottleneck asymmetric traveling salesman problem
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Approximation algorithms for the directed k-tour and k-stroll problems
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
A primal-dual approximation algorithm for the asymmetric prize-collecting TSP
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
k-edge-connectivity: approximation and LP relaxation
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods
SIAM Journal on Computing
A general framework for graph sparsification
Proceedings of the forty-third annual ACM symposium on Theory of computing
Deterministic algorithms for multi-criteria TSP
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
The effect of the asymmetry of road transportation networks on the traveling salesman problem
Computers and Operations Research
The entropy rounding method in approximation algorithms
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The asymmetric traveling salesman problem on graphs with bounded genus
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Multi-budgeted matchings and matroid intersection via dependent rounding
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On approximating multicriteria TSP
ACM Transactions on Algorithms (TALG)
Improving christofides' algorithm for the s-t path TSP
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Deterministic algorithms for multi-criteria Max-TSP
Discrete Applied Mathematics
A rounding by sampling approach to the minimum size k-arc connected subgraph problem
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
A primal-dual approximation algorithm for the Asymmetric Prize-Collecting TSP
Journal of Combinatorial Optimization
An improved integrality gap for asymmetric TSP paths
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Chain-Constrained spanning trees
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
An information complexity approach to extended formulations
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Improved inapproximability results for the shortest superstring and related problems
CATS '13 Proceedings of the Nineteenth Computing: The Australasian Theory Symposium - Volume 141
On integrality ratios for asymmetric TSP in the sherali-adams hierarchy
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
No-Wait flowshop scheduling is as hard as asymmetric traveling salesman problem
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Guest column: the elusive inapproximability of the TSP
ACM SIGACT News
| Hi-index | 0.00 |
We consider the Asymmetric Traveling Salesman problem for costs satisfying the triangle inequality. We derive a randomized algorithm which delivers a solution within a factor O(log n/ log log n) of the optimum with high probability.