Computing shortest heterochromatic monotone routes

Authors:
J. M. DíAz-BáñEz;G. HernáNdez;D. Oliveros;A. RamíRez-Vigueras;J. A. SellarèS;J. Urrutia;I. Ventura
Affiliations:
Departamento de Matemática Aplicada II, Universidad de Sevilla, Spain;Facultad de Informática, Universidad Politécnica de Madrid, Spain;Instituto de Matemáticas, Universidad Nacional Autónoma de México, Mexico;Instituto de Matemáticas, Universidad Nacional Autónoma de México, Mexico;Institut d'Informítica i Aplicacions, Universitat de Girona, Spain;Instituto de Matemáticas, Universidad Nacional Autónoma de México, Mexico;Departamento de Matemáticas, Universidad de Huelva, Spain
Venue:
Operations Research Letters
Year:
2008

Citing 11
Cited 1

On monotone paths among obstacles with applications to planning assemblies

SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Spatial tessellations: concepts and applications of Voronoi diagrams

Spatial tessellations: concepts and applications of Voronoi diagrams
New results on dynamic planar point location

SIAM Journal on Computing
Shortest paths and networks

Handbook of discrete and computational geometry
Dynamic Trees and Dynamic Point Location

SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximation of Point Sets by 1-Corner Polygonal Chains

INFORMS Journal on Computing
A PTAS for TSP with neighborhoods among fat regions in the plane

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
TSP with neighborhoods of varying size

Journal of Algorithms
Approximation algorithms for euclidean group TSP

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On trip planning queries in spatial databases

SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases

Computing optimal islands

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a set of n points on the plane colored with k@?n colors, the Trip Planning Problem asks for the shortest path visiting the k colors. It is a well-known NP-hard problem. We show that under some natural constraints on the path, the problem can be solved in polynomial time.