Network optimization on partitioned pairs of points

Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Su Jia, Matthew J. Katz, Tyler Mayer, Joseph S.B. Mitchell

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

Given n pairs of points, S = {{p1, q1}, {p2, q2}, . . . , {pn, qn}}, in some metric space, we study the problem of two-coloring the points within each pair, red and blue, to optimize the cost of a pair of node-disjoint networks, one over the red points and one over the blue points. In this paper we consider our network structures to be spanning trees, traveling salesman tours or matchings. We consider several different weight functions computed over the network structures induced, as well as several different objective functions. We show that some of these problems are NP-hard, and provide constant factor approximation algorithms in all cases.

Original languageEnglish
Title of host publication28th International Symposium on Algorithms and Computation, ISAAC 2017
EditorsTakeshi Tokuyama, Yoshio Okamoto
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770545
DOIs
StatePublished - 1 Dec 2017
Event28th International Symposium on Algorithms and Computation, ISAAC 2017 - Phuket, Thailand
Duration: 9 Dec 201722 Dec 2017

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume92
ISSN (Print)1868-8969

Conference

Conference28th International Symposium on Algorithms and Computation, ISAAC 2017
Country/TerritoryThailand
CityPhuket
Period9/12/1722/12/17

Keywords

  • Matching
  • NP-hard
  • Pairs
  • Spanning tree
  • Traveling salesman tour

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Network optimization on partitioned pairs of points'. Together they form a unique fingerprint.

Cite this