Sciweavers

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

8

CCCG
2007

favoriteEmaildiscussreport

108views Computational Geometry» more CCCG 2007»

Approximation Algorithms for the Minimum-Length Corridor and Related Problems

13 years 6 months ago

Approximation Algorithms for the Minimum-Length Corridor and Related Problems

Download cccg.ca

Given a rectangular boundary partitioned into rectangles, the MLC-R problem is to ﬁnd a Minimum EdgeLength Corridor that visits at least one point from the boundary of every rectangle and from the rectangular boundary. We present the ﬁrst polynomial time constant ratio approximation algorithm for the MLC-R problem, which has been shown to be NP-hard [5].

Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez

Real-time Traffic

CCCG 2007 | Computational Geometry | MLC-R Problem | Rectangular Boundary | ﬁrst Polynomial Time |

claim paper

Related Content

» Approximating corridors and tours via restriction and relaxation techniques

» MinimumLength Polygons of FirstClass Simple CubeCurves

» Widest Empty Corridor with Multiple Links and Rightangle Turns

» The Embroidery Problem

» Approximating Minimum Bending Energy Path in a Simple Corridor

» Listing All Parsimonious Reversal Sequences New Algorithms and Perspectives

» Approximation Algorithms for Euclidean Group TSP

» A Linear Time Approximation Algorithm for Ruler Folding Problem

» A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2007
Where	CCCG
Authors	Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez

Comments (0)