Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Constant Factor Approximation of VertexCuts in Planar Graphs
 

Summary: Constant Factor Approximation of Vertex­Cuts
in Planar Graphs
[Extended Abstract]
Eyal Amir
Computer Science Division
University of California
Berkeley, CA 94720.
eyal@cs.berkeley.edu
Robert Krauthgamer #
Computer Science Division
University of California
Berkeley, CA 94720.
robi@cs.berkeley.edu
Satish Rao
Computer Science Division
University of California
Berkeley, CA 94720.
satishr@cs.berkeley.edu
ABSTRACT
We devise the first constant factor approximation algorithm for

  

Source: Amir, Eyal - Department of Computer Science, University of Illinois at Urbana-Champaign

 

Collections: Computer Technologies and Information Sciences