scientific article; zbMATH DE number 2011856
zbMATH Open1032.68116MaRDI QIDQ4437508FDOQ4437508
Authors: Dirk Bongartz, Juraj Hromkovič, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger, Hans-Joachim Böckenhauer 
Publication date: 2 December 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2653/26530189.htm
Title of this publication is not available (Why is that?)
Recommendations
- On \(k\)-connectivity problems with sharpened triangle inequality
- ON THE VERTEX-CONNECTIVITY PROBLEM FOR GRAPHS WITH SHARPENED TRIANGLE INEQUALITY
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- An approximation algorithm for the minimum weight vertex-connectivity problem in complete graphs with sharpened triangle inequality.
- \(k\)-restricted edge-connectivity in triangle-free graphs
- Sharp bounds for decomposing graphs into edges and triangles
- \(k\)-edge-connectivity: approximation and LP relaxation
- scientific article; zbMATH DE number 1954373
- On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
- Contractible edges and triangles in \(k\)-connected graphs
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Approximation algorithms (68W25) Connectivity (05C40)
Cited In (11)
- \(k\)-edge-connectivity: approximation and LP relaxation
- ON THE VERTEX-CONNECTIVITY PROBLEM FOR GRAPHS WITH SHARPENED TRIANGLE INEQUALITY
- Title not available (Why is that?)
- On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
- Subgraphs decomposable into two trees and \(k\)-edge-connected subgraphs
- On \(k\)-connectivity problems with sharpened triangle inequality
- On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality
- On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality
- An approximation algorithm for the minimum weight vertex-connectivity problem in complete graphs with sharpened triangle inequality.
- Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality
- Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4437508)
