270 search results - page 9 / 54 » Diameter bounds for planar graphs |
166
click to vote
STACS
2009
Springer
16 years 23 days ago
2009
Springer
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
140
click to vote
JGT
2006
15 years 6 months ago
2006
Given a configuration of pebbles on the vertices of a graph G, a pebbling move consists of taking two pebbles off some vertex v and putting one of them back on a vertex adjacent t...
183
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
