Geometric planar networks on bichromatic collinear points
From MaRDI portal
Publication:2664940
DOI10.1016/j.tcs.2021.09.035MaRDI QIDQ2664940
Aritra Banik, Sayan Bandyapadhyay, Martin Nöllenburg, Sujoy Bhore
Publication date: 18 November 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.09.035
minimum spanning tree; Hamiltonian path; collinear points; red-blue points; minimum prefect matching
68Qxx: Theory of computing
Cites Work
- Unnamed Item
- Unnamed Item
- Alternating paths and cycles of minimum length
- Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon
- Approximating the bottleneck plane perfect matching of a point set
- Long alternating paths in bicolored point sets
- Planar bichromatic minimum spanning trees
- The book thickness of a graph
- Straight-line embeddings of two rooted trees in the plane
- Plane bichromatic trees of low degree
- Polynomially solvable cases of the bipartite traveling salesman problem
- Spanning trees in multipartite geometric graphs
- Efficient many-to-Many point matching in one dimension
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- The swapping problem
- Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
- Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
