TY - GEN
T1 - Network optimization on partitioned pairs of points
AU - Arkin, Esther M.
AU - Banik, Aritra
AU - Carmi, Paz
AU - Citovsky, Gui
AU - Jia, Su
AU - Katz, Matthew J.
AU - Mayer, Tyler
AU - Mitchell, Joseph S.B.
PY - 2017/12/1
Y1 - 2017/12/1
N2 - 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.
AB - 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.
KW - Matching
KW - NP-hard
KW - Pairs
KW - Spanning tree
KW - Traveling salesman tour
UR - https://www.scopus.com/pages/publications/85038562629
U2 - 10.4230/LIPIcs.ISAAC.2017.6
DO - 10.4230/LIPIcs.ISAAC.2017.6
M3 - Conference contribution
AN - SCOPUS:85038562629
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 28th International Symposium on Algorithms and Computation, ISAAC 2017
A2 - Tokuyama, Takeshi
A2 - Okamoto, Yoshio
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
T2 - 28th International Symposium on Algorithms and Computation, ISAAC 2017
Y2 - 9 December 2017 through 22 December 2017
ER -