On k-connectivity problems with sharpened triangle inequality

Authors:
Hans-Joachim Böckenhauer;Dirk Bongartz;Juraj Hromkovič;Ralf Klasing;Guido Proietti;Sebastian Seibert;Walter Unger
Affiliations:
Department Informatik, ETH Zentrum, CH-8092 Zürich, Switzerland;Lehrstuhl für Informatik I, RWTH Aachen, D-52056 Aachen, Germany;Department Informatik, ETH Zentrum, CH-8092 Zürich, Switzerland;LaBRI - Université Bordeaux 1 - CNRS, 351 cours de la Libération, 33405 Talence cedex, France;Dipartimento di Informatica, Universití di L'Aquila, I-67010 L'Aquila, Italy, and Istituto di Analisi dei Sistemi ed Informatica "Antonio Ruberti", CNR, Roma, Italy;Department Informatik, ETH Zentrum, CH-8092 Zürich, Switzerland;Lehrstuhl für Informatik I, RWTH Aachen, D-52056 Aachen, Germany
Venue:
Journal of Discrete Algorithms
Year:
2008

Citing 16
Cited 1

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
Improved approximation algorithms for uniform connectivity problems

Journal of Algorithms
Approximation algorithms for finding highly connected subgraphs

Approximation algorithms for NP-hard problems
A better approximation ratio for the minimum size k-edge-connected spanning subgraph problem

Journal of Algorithms
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

Algorithmics for hard problems: introduction to combinatorial optimization, randomization, approximation, and heuristics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching

SIAM Journal on Computing
Stability of Approximation Algorithms and the Knapsack Problem

Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality

Theoretical Computer Science
Approximating k-node Connected Subgraphs via Critical Graphs

SIAM Journal on Computing
On k-edge-connectivity problems with sharpened triangle inequality

CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Parameterized Complexity

Parameterized Complexity

Approximating survivable networks with β-metric costs

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

The k-connectivity problem is to find a minimum-cost k-edge- or k-vertex-connected spanning subgraph of an edge-weighted, undirected graph G for any given G and k. Here, we consider its NP-hard subproblems with respect to the parameter @b, with 12