On the approximation of maximum satisfiability
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Linear approximation of shortest superstrings
Journal of the ACM (JACM)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A survey of approximately optimal solutions to some covering and packing problems
ACM Computing Surveys (CSUR)
When Hamming meets Euclid: the approximability of geometric TSP and MST (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Approximation schemes for minimum latency problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A better approximation algorithm for finding planar subgraphs
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
On approximability of the minimum-cost k-connected spanning subgraph problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Simplicity and hardness of the maximum traveling salesman problem under geometric distances
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A polynomial-time approximation scheme for weighted planar graph TSP
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On the approximability of the traveling salesman problem (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Towards a 4/3 approximation for the asymmetric traveling salesman problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On the complexity of join predicates
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
An 8/13-approximation algorithm for the asymmetric maximum TSP
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Improving table compression with combinatorial optimization
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Light spanners and approximate TSP in weighted graphs with forbidden minors
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for time-dependent orienteering
Information Processing Letters
Faster approximation algorithms for the minimum latency problem
SODA '03 Proceedings of the fourteenth 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
Approximating asymmetric maximum TSP
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Performance Guarantees for the TSP with a Parameterized Triangle Inequality
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Approximation Hardness of TSP with Bounded Metrics
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Approximate TSP in Graphs with Forbidden Minors
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Approximations for ATSP with Parametrized Triangle Inequality
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Hardness of Approximation for Vertex-Connectivity Network-Design Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Computing Cycle Covers without Short Cycles
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Radio Labeling with Pre-assigned Frequencies
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Approximating Bounded Degree Instances of NP-Hard Problems
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Approximation Algorithms for Time-Dependent Orienteering
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
The geometric maximum traveling salesman problem
Journal of the ACM (JACM)
Improving table compression with combinatorial optimization
Journal of the ACM (JACM)
Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
Theoretical Computer Science
An 8/13-approximation algorithm for the asymmetric maximum TSP
Journal of Algorithms
Approximation algorithms for some vehicle routing problems
Discrete Applied Mathematics
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
Journal of the ACM (JACM)
A linear-time approximation scheme for planar weighted TSP
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
8/7-approximation algorithm for (1,2)-TSP
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Improved lower and upper bounds for universal TSP in planar metrics
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A subset spanner for Planar graphs,: with application to subset TSP
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Journal of Computer and System Sciences
The approximability of the weighted Hamiltonian path completion problem on a tree
Theoretical Computer Science
Theoretical Computer Science
Good triangulations yield good tours
Computers and Operations Research
Approximating TSP on metrics with bounded global growth
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating connected facility location problems via random facility sampling and core detouring
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A better differential approximation ratio for symmetric TSP
Theoretical Computer Science
The on-line asymmetric traveling salesman problem
Journal of Discrete Algorithms
Optimizing crimping operations in cable assembly shops
MATH'07 Proceedings of the 12th WSEAS International Conference on Applied Mathematics
A new approximation algorithm for the asymmetric TSP with triangle inequality
ACM Transactions on Algorithms (TALG)
Approximating Alternative Solutions
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
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
Degree-Constrained Subgraph Problems: Hardness and Approximation Results
Approximation and Online Algorithms
Not being (super)thin or solid is hard: A study of grid Hamiltonicity
Computational Geometry: Theory and Applications
Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2
Discrete Applied Mathematics
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Phase transitions and backbones of the asymmetric traveling salesman problem
Journal of Artificial Intelligence Research
Reoptimization of minimum and maximum traveling salesman's tours
Journal of Discrete Algorithms
Approximation algorithms for some vehicle routing problems
Discrete Applied Mathematics
Traveling salesman problem of segments
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Differential approximation for some routing problems
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
An explicit lower bound for TSP with distances one and two
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Connected facility location via random facility sampling and core detouring
Journal of Computer and System Sciences
Improved approximation algorithms for the minimum latency problem via prize-collecting strolls
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Paired approximation problems and incompatible inapproximabilities
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Knowing all optimal solutions does not help for TSP reoptimization
Computation, cooperation, and life
TSP on cubic and subcubic graphs
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Externalities among advertisers in sponsored search
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Reoptimization of minimum and maximum traveling salesman's tours
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Approximate fair cost allocation in metric traveling salesman games
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
The on-line asymmetric traveling salesman problem
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
(Non)-approximability for the multi-criteria TSP(1, 2)
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Approximation results for the weighted P4 partition problems
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
An improved approximation algorithm for TSP with distances one and two
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
A general framework for coloring problems: old results, new results, and open problems
IJCCGGT'03 Proceedings of the 2003 Indonesia-Japan joint conference on Combinatorial Geometry and Graph Theory
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
On approximating the maximum simple sharing problem
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On the approximability of some degree-constrained subgraph problems
Discrete Applied Mathematics
On the integrality gap of the subtour LP for the 1,2-TSP
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
Operations Research Letters
Exploiting planarity in separation routines for the symmetric traveling salesman problem
Discrete Optimization
Labeled Traveling Salesman Problems: Complexity and approximation
Discrete Optimization
When the greedy algorithm fails
Discrete Optimization
An improved upper bound for the TSP in cubic 3-edge-connected graphs
Operations Research Letters
Theoretical Computer Science
Light spanners in bounded pathwidth graphs
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Approximating the maximum sharing problem
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Advances in Engineering Software
Improved inapproximability results for the shortest superstring and related problems
CATS '13 Proceedings of the Nineteenth Computing: The Australasian Theory Symposium - Volume 141
Exponential approximation schemata for some network design problems
Journal of Discrete Algorithms
International Journal of Robotics Research
Guest column: the elusive inapproximability of the TSP
ACM SIGACT News
| Hi-index | 0.01 |