Approximation schemes for geometric NP-hard problems: A survey

Sanjeev Arora

doi:10.1007/3-540-45294-x_2

Approximation schemes for geometric NP-hard problems: A survey

Sanjeev Arora

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original language	English (US)
Title of host publication	FST TCS 2001
Subtitle of host publication	Foundations of Software Technology and Theoretical Computer Science - 21st Conference, Proceedings
Editors	Ramesh Hariharan, V. Vinay, Madhavan Mukund
Publisher	Springer Verlag
Pages	16-17
Number of pages	2
ISBN (Print)	3540430024
DOIs	https://doi.org/10.1007/3-540-45294-x_2
State	Published - 2001
Event	21st Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2001 - Bangalore, India Duration: Dec 13 2001 → Dec 15 2001

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2245

Other

Other	21st Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2001
Country/Territory	India
City	Bangalore
Period	12/13/01 → 12/15/01

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-45294-x_2

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

Arora, Sanjeev. / Approximation schemes for geometric NP-hard problems : A survey. FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science - 21st Conference, Proceedings. editor / Ramesh Hariharan ; V. Vinay ; Madhavan Mukund. Springer Verlag, 2001. pp. 16-17 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{ecf1a46187fd45a5898081611b8ca7fd,

title = "Approximation schemes for geometric NP-hard problems: A survey",

author = "Sanjeev Arora",

year = "2001",

doi = "10.1007/3-540-45294-x\_2",

language = "English (US)",

isbn = "3540430024",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "16--17",

editor = "Ramesh Hariharan and V. Vinay and Madhavan Mukund",

booktitle = "FST TCS 2001",

address = "Germany",

note = "21st Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2001 ; Conference date: 13-12-2001 Through 15-12-2001",

}

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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2245, Springer Verlag, pp. 16-17, 21st Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2001, Bangalore, India, 12/13/01. https://doi.org/10.1007/3-540-45294-x_2

Approximation schemes for geometric NP-hard problems: A survey. / Arora, Sanjeev.
FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science - 21st Conference, Proceedings. ed. / Ramesh Hariharan; V. Vinay; Madhavan Mukund. Springer Verlag, 2001. p. 16-17 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2245).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Approximation schemes for geometric NP-hard problems

T2 - 21st Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2001

AU - Arora, Sanjeev

PY - 2001

Y1 - 2001

UR - https://www.scopus.com/pages/publications/84944111523

UR - https://www.scopus.com/pages/publications/84944111523#tab=citedBy

U2 - 10.1007/3-540-45294-x_2

DO - 10.1007/3-540-45294-x_2

M3 - Conference contribution

SN - 3540430024

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 16

EP - 17

BT - FST TCS 2001

A2 - Hariharan, Ramesh

A2 - Vinay, V.

A2 - Mukund, Madhavan

PB - Springer Verlag

Y2 - 13 December 2001 through 15 December 2001

ER -

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

Approximation schemes for geometric NP-hard problems: A survey

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this