On linear programs with random costs
Mathematical Programming: Series A and B
On patching algorithms for random asymmetric traveling salesman problems
Mathematical Programming: Series A and B
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
When is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem?
SIAM Journal on Computing
Constructive bounds and exact expectation for the random assignment problem
Random Structures & Algorithms
On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
On the relationship between ATSP and the cycle cover problem
Theoretical Computer Science
An improved approximation algorithm for the ATSP with parameterized triangle inequality
Journal of Algorithms
Phase transitions and backbones of the asymmetric traveling salesman problem
Journal of Artificial Intelligence Research
Phase transitions of the asymmetric traveling salesman
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Review: Measuring instance difficulty for combinatorial optimization problems
Computers and Operations Research
Fast algorithms for weighted bipartite matching
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
| Hi-index | 0.00 |