National University of Singapore / University of New York / /
IndustryTerm
constant ratio algorithm / electrical network / feasible solution / approximation algorithm / near-optimal solutions / polynomial time constant ratio approximation algorithm / polynomial time approximation algorithm / data communications / parameterized approximation algorithm / Every feasible solution / constant ratio approximation algorithm / suboptimal solution / feasible solutions / Approximation algorithms / /
Organization
National University of Singapore / Department of Computer Science / University of New York at Buffalo / School of Computing / Universidad Autonoma de Queretaro / /
Person
Teofilo F. Gonzalez / /
ProvinceOrState
Ontario / /
Technology
known approximation algorithm / 3 Parameterized Algorithm / 1 Parameterized algorithm / polynomial time constant ratio approximation algorithm / approximation algorithm / parameterized algorithm / 2007 Approximation Algorithms / Approximation algorithms / constant ratio algorithm / Discussion Our approximation algorithm / polynomial time approximation algorithm / constant ratio approximation algorithm / optical fiber / parameterized approximation algorithm / /
CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximation Algorithms for the Minimum-Length Corridor and Related Problems Arturo Gonzalez-Gutierrez∗