Skip to main content
Journal ArticleOPEN ACCESS

Geometric optimization and DP-completeness

Discrete & Computational Geometry (1989) 4(1) 3-13
DOI: 10.1007/BF02187711
0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

References Powered by Scopus

Optimal packing and covering in the plane are NP-complete

Information Processing Letters
594Citations
N/AReaders
Get full text

ON THE COMPLEXITY OF SOME COMMON GEOMETRIC LOCATION PROBLEMS.

SIAM Journal on Computing
565Citations
N/AReaders
Get full text

A comparison of polynomial time reducibilities

Theoretical Computer Science
259Citations
N/AReaders
Get full text
View more at Scopus

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

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

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 2

40%

Researcher 2

40%

Professor / Associate Prof. 1

20%

Readers' Discipline

Tooltip

Computer Science 4

80%

Physics and Astronomy 1

20%

Save time finding and organizing research with Mendeley

Sign up for free