Geometric Planar Networks on Bichromatic Points

Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg

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

2 Scopus citations

Abstract

We study four classical graph problems – Hamiltonian path, Traveling salesman, Minimum spanning tree, and Minimum perfect matching on geometric graphs induced by bichromatic (and) points. These problems have been widely studied for points in the Euclidean plane, and many of them are-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.

Original languageEnglish
Title of host publicationAlgorithms and Discrete Applied Mathematics - 6th International Conference, CALDAM 2020, Proceedings
EditorsManoj Changat, Sandip Das
PublisherSpringer
Pages79-91
Number of pages13
ISBN (Print)9783030392185
DOIs
StatePublished - 1 Jan 2020
Externally publishedYes
Event6th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2020 - Hyderabad, India
Duration: 13 Feb 202015 Feb 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12016 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2020
Country/TerritoryIndia
CityHyderabad
Period13/02/2015/02/20

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Geometric Planar Networks on Bichromatic Points'. Together they form a unique fingerprint.

Cite this