DeepAI AI Chat
Log In Sign Up

Network Optimization on Partitioned Pairs of Points

10/02/2017
by   Esther M. Arkin, et al.
Stony Brook University
Ben-Gurion University of the Negev
0

Given n pairs of points, S = {{p_1, q_1}, {p_2, q_2}, ..., {p_n, q_n}}, 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

07/21/2018

Red-Blue-Partitioned MST, TSP, and Matching

Arkin et al. ArkinBCCJKMM17 recently introduced partitioned pairs networ...
11/10/2021

Approximating bottleneck spanning trees on partitioned tuples of points

We present approximation algorithms for the following NP-hard optimizati...
08/02/2021

Biobjective Optimization Problems on Matroids with Binary Costs

Like most multiobjective combinatorial optimization problems, biobjectiv...
06/26/2023

Scenic Routes in R^d

In this work, we introduce the problem of scenic routes among points in ...
10/27/2020

On Minimum Generalized Manhattan Connections

We consider minimum-cardinality Manhattan connected sets with arbitrary ...
09/28/2018

On Locality-Sensitive Orderings and their Applications

For any constant d and parameter ε > 0, we show the existence of (roughl...