English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  Covering Rectilinear Polygons with Axis-Parallel Rectangles

Kumar, V. S. A., & Hariharan, R. (1999). Covering Rectilinear Polygons with Axis-Parallel Rectangles. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99) (pp. 445-454). New York, USA: ACM.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-35B4-7 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-35B5-5
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Kumar, V. S. Anil1, Author           
Hariharan, Ramesh1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: We give an $O(\sqrt{\log n})$ factor approximation algorithm for covering a rectilinear polygon with holes using axis-parallel rectangles. This is the first polynomial time approximation algorithm for this problem with a $o(\log n)$ approximation factor.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-021999
 Publication Status: Issued
 Pages: -
 Publishing info: New York, USA : ACM
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 518050
Other: Local-ID: C1256428004B93B8-79A3ADF8D3C95E50C12568A90034C4D7-Kumar1999a
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Atlanta, USA
Start-/End Date: 1999

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99)
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York, USA : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 445 - 454 Identifier: -