BibTeX
CSL-JSON
MLA
Harvard
Geometric Planar Networks on Bichromatic Points
release_qh25huacmffuhhcfi7tbllnzre
by
Sayan Bandyapadhyay and Aritra Banik and Sujoy Bhore and Martin
Nöllenburg
Released
as a article
.
2019
Abstract
We study four classical graph problems -- Hamiltonian path, Traveling
salesman, Minimum spanning tree, and Minimum perfect matching on geometric
graphs induced by bichromatic (red and blue) points. These problems have been
widely studied for points in the Euclidean plane, and many of them are NP-hard.
In this work, we consider these problems in two restricted settings: (i)
collinear points and (ii) equidistant points on a circle. We show that almost
all of these problems can be solved in linear time in these constrained, yet
non-trivial settings.
In text/plain
format
Archived Files and Locations
application/pdf 580.7 kB
file_ydrhe6psdjhetjyohngtolaopi
|
arxiv.org (repository) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
arXiv
1911.08924v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links