Abstract
In this paper we show a number of natural geometric optimization problems in the plane to be complete for a class DP. The class Dp contains both NP and Co-NP and is contained in Δ2P=PNP. Completeness in Dp is exhibited under many-one and positive reductions. Further an OptP(O(log n)) result is also obtained for some of these optimization problems. © 1989 Springer-Verlag New York Inc.
Cite
CITATION STYLE
APA
Bajaj, C., & Li, M. (1989). Geometric optimization and DP-completeness. Discrete & Computational Geometry, 4(1), 3–13. https://doi.org/10.1007/BF02187711
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free