OpenAlex | A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest

A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest

Work

Year: 2015

Type: article

Abstract: We give a randomized O ( n polylog n )-time approximation scheme for the Steiner forest problem in the Euclidean plane. For every fixed ϵ > 0 and given n terminals in the plane with connection requ... more

Source: ACM Transactions on Algorithms

Authors Glencora Borradaile, Philip N. Klein, Claire Mathieu

Institutions Oregon State University, John Brown University, École Normale Supérieure

Cites: 23

Cited by: 18

Related to: 10

FWCI: 1.031

Citation percentile (by year/subfield): 85.65

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Sustainable Development Goal Life on land

Open Access status: green