Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

88

Voted

STOC
2005
ACM

81views Algorithms» more STOC 2005»

Improved approximation algorithms for minimum-weight vertex separators

16 years 3 months ago

Improved approximation algorithms for minimum-weight vertex separators

Download www.cs.washington.edu

Uriel Feige, Mohammad Taghi Hajiaghayi, James R. L

Real-time Traffic

Algorithms | Minimum-weight Vertex Separators | STOC 2005 |

claim paper

Related Content

» Improved Approximation Algorithms for Minimum Weight Vertex Separators

» An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs

» ConstantFactor Approximation for MinimumWeight Connected Dominating Sets in Unit Disk Grap...

» MinimumWeight Cycle Covers and Their Approximability

» Spanning trees with minimum weighted degrees

» A PrimalDual Approximation Algorithm for Partial Vertex Cover Making Educated Guesses

» Improved Algorithms for the Feedback Vertex Set Problems

» Approximation of Partial Capacitated Vertex Cover

» Vertex Cover in Graphs with Locally Few Colors

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2005
Where	STOC
Authors	Uriel Feige, Mohammad Taghi Hajiaghayi, James R. Lee

Comments (0)