Approximation schemes for geometric NP-hard problems: A survey

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Original languageEnglish (US)
Title of host publicationFST TCS 2001
Subtitle of host publicationFoundations of Software Technology and Theoretical Computer Science - 21st Conference, Proceedings
EditorsRamesh Hariharan, V. Vinay, Madhavan Mukund
PublisherSpringer Verlag
Pages16-17
Number of pages2
ISBN (Print)3540430024
DOIs
StatePublished - Jan 1 2001
Event21st Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2001 - Bangalore, India
Duration: Dec 13 2001Dec 15 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2245
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other21st Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2001
CountryIndia
CityBangalore
Period12/13/0112/15/01

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Approximation schemes for geometric NP-hard problems: A survey'. Together they form a unique fingerprint.

  • Cite this

    Arora, S. (2001). Approximation schemes for geometric NP-hard problems: A survey. In R. Hariharan, V. Vinay, & M. Mukund (Eds.), FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science - 21st Conference, Proceedings (pp. 16-17). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2245). Springer Verlag. https://doi.org/10.1007/3-540-45294-x_2