Search Sciweavers | Sciweavers

270 search results - page 9 / 54

» Diameter bounds for planar graphs

click to vote

STACS
2009
Springer

152views Theoretical Computer Science» more STACS 2009»

Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs

14 years 4 months ago

Download drops.dagstuhl.de

We present the ﬁrst polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...

Glencora Borradaile, Erik D. Demaine, Siamak Tazar...

claim paper

Read More »

click to vote

JGT
2006

48views more JGT 2006»

Maximum pebbling number of graphs of diameter three

13 years 9 months ago

Download www.borisbukh.org

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...

Boris Bukh

claim paper

Read More »

click to vote

STOC
2010
ACM

295views Algorithms» more STOC 2010»

Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth

14 years 2 months ago

Download www.cs.bme.hu

We give the ﬁrst polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a ﬁrst step, w...

MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...

claim paper

Read More »

click to vote

COMPGEOM
2007
ACM

115views Discrete Geometry» more COMPGEOM 2007»

Probabilistic embeddings of bounded genus graphs into planar graphs

14 years 1 months ago