Automata, Languages and Programming
From MaRDI portal
Publication:5716858
DOI10.1007/11523468zbMath1084.90043OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716858
Nabil H. Mustafa, Khaled M. Elbassioni, R. A. Sitters, Aleksei V. Fishkin
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Related Items (8)
On the minimum corridor connection problem and other generalized geometric problems ⋮ Approximation Algorithms for Generalized MST and TSP in Grid Clusters ⋮ Algorithms for interval structures with applications ⋮ A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics ⋮ Dubins traveling salesman problem with neighborhoods: a graph-based approach ⋮ Algorithms for Interval Structures with Applications ⋮ Computing shortest heterochromatic monotone routes ⋮ Serving rides of equal importance for time-limited dial-a-ride
This page was built for publication: Automata, Languages and Programming
