Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Approximation Schemes for Degreerestricted MST and RedBlue Separation Problem
 

Summary: Approximation Schemes for Degree­restricted
MST and Red­Blue Separation Problem
Sanjeev Arora # Kevin L. Chang +
Abstract
We develop a quasi­polynomial time approximation scheme for
the Euclidean version of the Degree­restricted MST problem by adapt­
ing techniques used previously by Arora for approximating TSP.
Given n points in the plane, d = 3 or 4, and # > 0, the scheme finds
an approximation with cost within 1+# of the lowest cost spanning
tree with the property that all nodes have degree at most d.
We also develop a polynomial time approximation scheme for
the Euclidean version of the Red­Blue Separation Problem, again
extending Arora's techniques. Given # > 0, the scheme finds an
approximation with cost within 1 + # of the cost of the optimum
separating polygon of the input nodes, in nearly linear time.
# arora@cs.princeton.edu. Princeton University, Princeton, NJ. Supported by
David and Lucille Packard Fellowship, and NSF Grants CCR­0098180 and CCR­009818.
Work done partially while visiting the CS Dept at UC Berkeley.
+ kevinc@cs.yale.edu. Yale University, New Haven, CT.
1

  

Source: Arora, Sanjeev - Department of Computer Science, Princeton University

 

Collections: Computer Technologies and Information Sciences