scientific article

zbMath1078.68637MaRDI QIDQ3046489

Miroslav Chlebík, Janka Chlebíková

Publication date: 12 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2368/23680170.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (max. 100)

Complexity of approximating bounded variants of optimization problems ⋮ A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs ⋮ Unnamed Item ⋮ A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes ⋮ A robust and scalable algorithm for the Steiner problem in graphs ⋮ On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree ⋮ On the approximability of dense Steiner problems ⋮ Stronger path‐based extended formulation for the Steiner tree problem ⋮ Robust Algorithms for TSP and Steiner Tree ⋮ A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs ⋮ Approximation algorithms for general packing problems and their application to the multicast congestion problem ⋮ On routing in VLSI design and communication networks ⋮ A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design ⋮ Unnamed Item ⋮ Packing trees in communication networks ⋮ Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation ⋮ On approximation algorithms for the terminal Steiner tree problem ⋮ Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices

This page was built for publication: