Search Sciweavers | Sciweavers

1161 search results - page 6 / 233

» Approximation schemes for clustering problems

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

STOC
1995
ACM

145views Algorithms» more STOC 1995»

Polynomial time approximation schemes for dense instances of NP-hard problems

14 years 2 months ago

Download www.cs.tau.ac.il

We present a uniﬁed framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...

Sanjeev Arora, David R. Karger, Marek Karpinski

claim paper

Read More »

click to vote

STOC
2005
ACM

111views Algorithms» more STOC 2005»

Tensor decomposition and approximation schemes for constraint satisfaction problems

14 years 11 months ago