Approximation algorithms for graph augmentation
Journal of Algorithms
Biconnectivity approximations and graph carvings
Journal of the ACM (JACM)
Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities
SIAM Journal on Discrete Mathematics
On approximability of the minimum-cost k-connected spanning subgraph problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Performance guarantees for the TSP with a parameterized triangle inequality
Information Processing Letters
Approximation algorithms for the TSP with sharpened triangle inequality
Information Processing Letters
Algorithmics for hard problems: introduction to combinatorial optimization, randomization, approximation, and heuristics
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Approximations for ATSP with Parametrized Triangle Inequality
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Parameterized Complexity
On k-connectivity problems with sharpened triangle inequality
Journal of Discrete Algorithms
k-edge-connectivity: approximation and LP relaxation
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Approximating survivable networks with β-metric costs
Journal of Discrete Algorithms
Hi-index | 5.24 |
In this paper we investigate the problem of finding a 2-connected spanning subgraph of minimal cost in a complete and weighted graph G. This problem is known to be APX-hard, for both the edge and the vertex connectivity case. Here we prove that the APX-hardness still holds even if one restricts the edge costs to an interval [1, 1 + ε], for an arbitrary small ε 0. This result implies the first explicit lower bound on the approximability of the general version (i.e., for arbitrary graphs) of the problem. On the other hand, if the input graph satisfies the sharpened β-triangle inequality, then a (2/3 + 1/3 ċ β/1-β)-approximation algorithm is designed. This ratio tends to 1 with β tending to ½, and it improves the previous known bound of 3/2, holding for graphs satisfying the triangle inequality, as soon as β G by means of a set of edges of minimum cost is considered. This problem is known to admit a 2-approximation algorithm. Here we show that whenever the input graph satisfies the sharpened β-triangle inequality with β