A Polynomial Time Approximation Scheme for the problem of Interconnecting Highways
2000-11-28
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
A Polynomial Time Approximation Scheme for the problem of Interconnecting Highways
Authors
Published Date
2000-11-28
Publisher
Type
Report
Abstract
The objective of the Interconnecting Highways problem is to construct roads of minimum total length to interconnect given highways under the constraint that the roads can intersect each highway only at one point in a designated interval which is a line segment. We present a polynomial time approximation scheme for this problem by applying Arora's framework in [2]. For every fixed c>1 and given any n line segments in the plane, a randomized version of the scheme finds a (1+1/c)-approximation to the optimal cost in O(n o(c)log n) time.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Cheng, Xiuzhen; Kim, Joon-Mo; Lu, Bing. (2000). A Polynomial Time Approximation Scheme for the problem of Interconnecting Highways. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215447.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.