Computing Geometric Minimum-dilation Graphs is NP-hard

Giannopoulos, Panos; Klein, Rolf; Kutz, Martin; Marx, Daniel

doi:10.1142/S0218195910003244

Local TagsRelease HistoryDetailsSummary

Computing Geometric Minimum-dilation Graphs is NP-hard

Giannopoulos, P., Klein, R., Kutz, M., & Marx, D. (2010). Computing Geometric Minimum-dilation Graphs is NP-hard. International Journal of Computational Geometry & Applications, 20(2), 147-173. doi:10.1142/S0218195910003244.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-162A-E Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-2644-A

Genre: Journal Article

Latex : Computing Geometric Minimum-dilation Graphs is {NP}-hard

Files

show Files

Locators

show

Creators

show

hide

Creators:
Giannopoulos, Panos¹, Author
Klein, Rolf¹, Author
Kutz, Martin², Author
Marx, Daniel¹, Author

Affiliations:
1External Organizations, ou_persistent22
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Published Online: 2010Date issued: 2010

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 536816
DOI: 10.1142/S0218195910003244
URI: http://dx.doi.org/10.1142/S0218195910003244
Other: Local-ID: C1256428004B93B8-1CA6566A9621EFC2C12578310042D9F7-Giannopoulos2010

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: International Journal of Computational Geometry & Applications

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Singapore : World Scientific

Pages: - Volume / Issue: 20 (2) Sequence Number: - Start / End Page: 147 - 173 Identifier: ISSN: 0218-1959