Approximating Minimum Manhattan Networks in Higher Dimensions

Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G Kobourov, Joachim Spoerhase, Alexander Wolff

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

We study the minimum Manhattan network problem, which is defined as follows. Given a set of points called terminals in (Formula presented.), find a minimum-length network such that each pair of terminals is connected by a set of axis-parallel line segments whose total length is equal to the pair’s Manhattan (that is, L1-) distance. The problem is NP-hard in 2D and there is no PTAS for 3D (unless (Formula presented.)). Approximation algorithms are known for 2D, but not for 3D. We present, for any fixed dimension d and any ε>0, an O(nε)-approximation algorithm. For 3D, we also give a 4(k−1)-approximation algorithm for the case that the terminals are contained in the union of k≥2 parallel planes.

Original languageEnglish (US)
Pages (from-to)36-52
Number of pages17
JournalAlgorithmica
Volume71
Issue number1
DOIs
StatePublished - 2013

Fingerprint

Approximation algorithms
Higher Dimensions
Approximation Algorithms
Line segment
Set of points
Computational complexity
Union
NP-complete problem

Keywords

  • Approximation algorithms
  • Computational geometry
  • Minimum Manhattan network

ASJC Scopus subject areas

  • Computer Science(all)
  • Computer Science Applications
  • Applied Mathematics

Cite this

Das, A., Gansner, E. R., Kaufmann, M., Kobourov, S. G., Spoerhase, J., & Wolff, A. (2013). Approximating Minimum Manhattan Networks in Higher Dimensions. Algorithmica, 71(1), 36-52. https://doi.org/10.1007/s00453-013-9778-z

Approximating Minimum Manhattan Networks in Higher Dimensions. / Das, Aparna; Gansner, Emden R.; Kaufmann, Michael; Kobourov, Stephen G; Spoerhase, Joachim; Wolff, Alexander.

In: Algorithmica, Vol. 71, No. 1, 2013, p. 36-52.

Research output: Contribution to journalArticle

Das, A, Gansner, ER, Kaufmann, M, Kobourov, SG, Spoerhase, J & Wolff, A 2013, 'Approximating Minimum Manhattan Networks in Higher Dimensions', Algorithmica, vol. 71, no. 1, pp. 36-52. https://doi.org/10.1007/s00453-013-9778-z
Das, Aparna ; Gansner, Emden R. ; Kaufmann, Michael ; Kobourov, Stephen G ; Spoerhase, Joachim ; Wolff, Alexander. / Approximating Minimum Manhattan Networks in Higher Dimensions. In: Algorithmica. 2013 ; Vol. 71, No. 1. pp. 36-52.
@article{44c9d935d44c4d10b15414a9bb9530ef,
title = "Approximating Minimum Manhattan Networks in Higher Dimensions",
abstract = "We study the minimum Manhattan network problem, which is defined as follows. Given a set of points called terminals in (Formula presented.), find a minimum-length network such that each pair of terminals is connected by a set of axis-parallel line segments whose total length is equal to the pair’s Manhattan (that is, L1-) distance. The problem is NP-hard in 2D and there is no PTAS for 3D (unless (Formula presented.)). Approximation algorithms are known for 2D, but not for 3D. We present, for any fixed dimension d and any ε>0, an O(nε)-approximation algorithm. For 3D, we also give a 4(k−1)-approximation algorithm for the case that the terminals are contained in the union of k≥2 parallel planes.",
keywords = "Approximation algorithms, Computational geometry, Minimum Manhattan network",
author = "Aparna Das and Gansner, {Emden R.} and Michael Kaufmann and Kobourov, {Stephen G} and Joachim Spoerhase and Alexander Wolff",
year = "2013",
doi = "10.1007/s00453-013-9778-z",
language = "English (US)",
volume = "71",
pages = "36--52",
journal = "Algorithmica",
issn = "0178-4617",
publisher = "Springer New York",
number = "1",

}

TY - JOUR

T1 - Approximating Minimum Manhattan Networks in Higher Dimensions

AU - Das, Aparna

AU - Gansner, Emden R.

AU - Kaufmann, Michael

AU - Kobourov, Stephen G

AU - Spoerhase, Joachim

AU - Wolff, Alexander

PY - 2013

Y1 - 2013

N2 - We study the minimum Manhattan network problem, which is defined as follows. Given a set of points called terminals in (Formula presented.), find a minimum-length network such that each pair of terminals is connected by a set of axis-parallel line segments whose total length is equal to the pair’s Manhattan (that is, L1-) distance. The problem is NP-hard in 2D and there is no PTAS for 3D (unless (Formula presented.)). Approximation algorithms are known for 2D, but not for 3D. We present, for any fixed dimension d and any ε>0, an O(nε)-approximation algorithm. For 3D, we also give a 4(k−1)-approximation algorithm for the case that the terminals are contained in the union of k≥2 parallel planes.

AB - We study the minimum Manhattan network problem, which is defined as follows. Given a set of points called terminals in (Formula presented.), find a minimum-length network such that each pair of terminals is connected by a set of axis-parallel line segments whose total length is equal to the pair’s Manhattan (that is, L1-) distance. The problem is NP-hard in 2D and there is no PTAS for 3D (unless (Formula presented.)). Approximation algorithms are known for 2D, but not for 3D. We present, for any fixed dimension d and any ε>0, an O(nε)-approximation algorithm. For 3D, we also give a 4(k−1)-approximation algorithm for the case that the terminals are contained in the union of k≥2 parallel planes.

KW - Approximation algorithms

KW - Computational geometry

KW - Minimum Manhattan network

UR - http://www.scopus.com/inward/record.url?scp=84922000454&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84922000454&partnerID=8YFLogxK

U2 - 10.1007/s00453-013-9778-z

DO - 10.1007/s00453-013-9778-z

M3 - Article

VL - 71

SP - 36

EP - 52

JO - Algorithmica

JF - Algorithmica

SN - 0178-4617

IS - 1

ER -