Towards a 4/3 approximation for the asymmetric traveling salesman problem
SODA '00 Proceedings of the eleventh 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
A New Bound for the 2-Edge Connected Subgraph Problem
Proceedings of the 6th International IPCO Conference on Integer Programming and Combinatorial Optimization
Critical Extreme Points of the 2-Edge Connected Spanning Subgraph Polytope
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks
Discrete Applied Mathematics - Submodularity
Approximation algorithms for network design with metric costs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On the Integrality Ratio for the Asymmetric Traveling Salesman Problem
Mathematics of Operations Research
Reliability Models for Facility Location: The Expected Failure Cost Case
Transportation Science
Some structural and geometric properties of two-connected steiner networks
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
The box-TDI system associated with 2-edge connected spanning subgraphs
Discrete Applied Mathematics
FGIT '09 Proceedings of the 1st International Conference on Future Generation Information Technology
Some new structural properties of shortest 2-connected Steiner networks
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Degree Bounded Network Design with Metric Costs
SIAM Journal on Computing
The bottleneck 2-connected k-Steiner network problem for k≤2
Discrete Applied Mathematics
On the integrality ratio for tree augmentation
Operations Research Letters
Analysis of the Held-Karp lower bound for the asymmetric TSP
Operations Research Letters
2-Change for k-connected networks
Operations Research Letters
On finding two-connected subgraphs in planar graphs
Operations Research Letters
On the structure and complexity of the 2-connected Steiner network problem in the plane
Operations Research Letters
Operations Research Letters
Two-connected Steiner networks: structural properties
Operations Research Letters
Design of Survivable Networks Using Three-and Four-Partition Facets
Operations Research
| Hi-index | 0.00 |