Network optimization on partitioned pairs of points
DOI10.4230/LIPICS.ISAAC.2017.6zbMATH Open1457.68199arXiv1710.00876MaRDI QIDQ5136221FDOQ5136221
Authors: Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Su Jia, Tyler Mayer, Joseph S. B. Mitchell, Matthew J. Katz 
Publication date: 25 November 2020
Full work available at URL: https://arxiv.org/abs/1710.00876
Recommendations
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cites Work
- Introduction to algorithms
- Computing the smallest color-spanning axis-parallel square
- Title not available (Why is that?)
- On the complexity of partitioning graphs into connected subgraphs
- On the generalized minimum spanning tree problem
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
- New models of the generalized minimum spanning tree problem
- Bichromatic 2-center of pairs of points
- Minimum-diameter covering problems
- SMALLEST COLOR-SPANNING OBJECT REVISITED
- Geometric avatar problems
- Improved upper bounds for the Steiner ratio
- Approximation algorithms for generalized MST and TSP in grid clusters
- Relaxation methods for the Generalized Minimum Spanning Tree problem
Cited In (4)
This page was built for publication: Network optimization on partitioned pairs of points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136221)
