Minimum-weight two-connected spanning networks
Mathematical Programming: Series A and B
The traveling salesman problem with distances one and two
Mathematics of Operations Research
Survivable networks, linear programming relaxations and the parsimonious property
Mathematical Programming: Series A and B
P-Complete Approximation Problems
Journal of the ACM (JACM)
Randomized metarounding (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On the approximability of the traveling salesman problem (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
An 8/13-approximation algorithm for the asymmetric maximum TSP
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
A new approximation algorithm for the asymmetric TSP with triangle inequality
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximations for ATSP with Parametrized Triangle Inequality
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
An 8/13-approximation algorithm for the asymmetric maximum TSP
Journal of Algorithms
A survey of approximation algorithms for multicast congestion problems
TELE-INFO'06 Proceedings of the 5th WSEAS international conference on Telecommunications and informatics
The asymmetric traveling salesman problem on graphs with bounded genus
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |