Bottleneck bichromatic full Steiner trees
DOI10.1016/j.ipl.2018.10.003zbMath1469.68144OpenAlexW2897253417MaRDI QIDQ1628678
A. Karim Abu-Affash, Paz Carmi, Sujoy Bhore, Dibyayan Chakraborty
Publication date: 5 December 2018
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2018.10.003
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cites Work
- An optimal algorithm for the Euclidean bottleneck full Steiner tree problem
- Euclidean minimum spanning trees and bichromatic closest pairs
- New approximation algorithms for the Steiner tree problems
- The Euclidean bottleneck full Steiner tree problem
- Proof verification and the hardness of approximation problems
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- The Complexity of Computing Steiner Minimal Trees
- A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3
- ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS
- COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS
- AN OPTIMAL ALGORITHM FOR COMPUTING (≤K)-LEVELS, WITH APPLICATIONS
- SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Bottleneck bichromatic full Steiner trees
