Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Approximation schemes for NP-hard geometric optimization problems: a survey
Home
Publications
Approximation schemes for NP-hard geometric optimization problems: a survey
Approximation schemes for NP-hard geometric optimization problems: a survey
Author:
SA
Sanjeev Arora
Sanjeev Arora
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Publisher website
Google Scholar
1 July 2003
journal article
research article
Published by
Springer Nature
in
Mathematical Programming
Vol. 97
(1)
,
43-69
DOI:
10.1007/s10107-003-0438-y
Abstract
No abstract available
Keywords
APPROXIMATION ALGORITHM
POLYNOMIAL TIME
APPROXIMATION SCHEME
EFFICIENT ALGORITHM
GEOMETRIC OPTIMIZATION
Cited
Cited by 127 articles
Scroll to top