scientific article; zbMATH DE number 7053305

zbMath1421.68214arXiv1110.1320MaRDI QIDQ5743426

David Eisenstat, Claire Mathieu, Philip N. Klein

Publication date: 10 May 2019

Full work available at URL: https://arxiv.org/abs/1110.1320

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (5)

Simultaneously load balancing for every p-norm, with reassignments ⋮ Unnamed Item ⋮ A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs ⋮ Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) ⋮ Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Steiner forest problem revisited
• The Steiner problem with edge lengths 1 and 2
• A data structure for bicategories, with application to speeding up an approximation algorithm
• Fast 3-coloring triangle-free planar graphs
• Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth
• An O ( n log n ) approximation scheme for Steiner tree in planar graphs
• A General Approximation Technique for Constrained Forest Problems
• When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
• A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest

This page was built for publication: