Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs
DOI10.1007/S00453-012-9662-2zbMATH Open1303.05183OpenAlexW1607394607MaRDI QIDQ476424FDOQ476424
Authors: Glencora Borradaile, Erik D. Demaine, Siamak Tazari 
Publication date: 2 December 2014
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2009/1835/
Recommendations
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs
- Approximating connectivity domination in weighted bounded-genus graphs
- Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
- Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth
- scientific article; zbMATH DE number 6381654
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Planar graphs; geometric and topological aspects of graph theory (05C10) Signed and weighted graphs (05C22) Connectivity (05C40)
Cites Work
- Graphs on surfaces
- Approximation algorithms for NP-complete problems on planar graphs
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Graph minors. II. Algorithmic aspects of tree-width
- Subexponential parameterized algorithms on bounded-genus graphs and \(H\)-minor-free graphs
- Maintenance of a minimum spanning forest in a dynamic plane graph
- Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation
- Bidimensionality: new connections between FPT algorithms and PTASs
- Faster shortest-path algorithms for planar graphs
- Graph minors. XVI: Excluding a non-planar graph
- Local tree-width, excluded minors, and approximation algorithms
- A faster approximation algorithm for the Steiner problem in graphs
- Approximation schemes for NP-hard geometric optimization problems: a survey
- Greedy optimal homotopy and homology generators
- Multiple source shortest paths in a genus \(g\) graph
- A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
- Title not available (Why is that?)
- Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon
- Dealing with large hidden constants, engineering a planar Steiner tree PTAS
- Title not available (Why is that?)
- A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
- Contraction decomposition in \(h\)-minor-free graphs and algorithmic applications
- Title not available (Why is that?)
- Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth
- Title not available (Why is that?)
- A subset spanner for Planar graphs, with application to subset TSP
- Improved Steiner tree algorithms for bounded treewidth
- The Two-Edge Connectivity Survivable Network Problem in Planar Graphs
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Title not available (Why is that?)
Cited In (13)
- Special frequency quadrilaterals and an application
- A quick method to compute sparse graphs for traveling salesman problem using random frequency quadrilaterals
- Correlation clustering and two-edge-connected augmentation for planar graphs
- Approximating connectivity domination in weighted bounded-genus graphs
- The polynomial randomized algorithm to compute bounded degree graph for TSP based on frequency quadrilaterals
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs
- Near-linear-time deterministic plane Steiner spanners for well-spaced point sets
- Minimum Cuts in Surface Graphs
- Approximation algorithms via contraction decomposition
- A fixed parameter tractable approximation scheme for the optimal cut graph of a surface
- Extending the kernel for planar Steiner tree to the number of Steiner vertices
- Walking through waypoints
- The distribution of edge-frequencies computed with frequency quadrilaterals for traveling salesman problem
This page was built for publication: Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476424)
