Work

An efficient polynomial-time approximation scheme for Steiner forest in planar graphs

Year: 2011

Type: preprint

Abstract: We give an $O(n \log^3 n)$ approximation scheme for Steiner forest in planar graphs, improving on the previous approximation scheme for this problem, which runs in $O(n^{f(ε)})$ time.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1110.1320

Authors: Eisenstat, David, Klein, Philip, Mathieu, Claire

Institution: Brown University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: National Science Foundation

Award: AF: Medium: Collaborative Research: Solutions to Planar Optimization Problems

OpenAlex ID: W4296589008

Cites:

Cited by:

Related to: 10