Constructing competitive tours from local information

DOI10.1007/3-540-56939-1_65MaRDI QIDQ4630252zbMATH OpenOpenAlexFDO

Authors Bala Kalyanasundaram, Kirk Pruhs

Publication date 29 March 2019

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-56939-1_65

zbMATH Keywords

boundary edgeminimum spanning treeonline algorithmplanar graphSteiner tree

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Online algorithms; streaming algorithms (68W27)

Recommendations

• Detection of local tourism systems by threshold accepting
• On the structure of local tournaments
• Perception and information in a competitive location model
• A combined local search and integer programming approach to the traveling tournament problem

Cites work

• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Constructing competitive tours from local information
• Constructing Reliable Communication Networks of Small Weight Online
• Dynamic Steiner Tree Problem
• How to learn an unknown environment. I
• scientific article; zbMATH DE number 432827 (Why is no real title available?)
• scientific article; zbMATH DE number 4155925 (Why is no real title available?)
• scientific article; zbMATH DE number 4155926 (Why is no real title available?)
• scientific article; zbMATH DE number 4062645 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 65704 (Why is no real title available?)
• scientific article; zbMATH DE number 65705 (Why is no real title available?)
• scientific article; zbMATH DE number 1301093 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• Not all insertion methods yield constant approximate tours in the Euclidean plane
• On-line Steiner trees in the Euclidean plane
• The relative neighbourhood graph of a finite planar set

Cited in

(8)

• Not all insertion methods yield constant approximate tours in the Euclidean plane
• Competitive on-line coverage of grid environments by a mobile robot
• Exploring sparse graphs with advice
• Lower and upper competitive bounds for online directed graph exploration
• Serving requests with on-line routing
• Competitive algorithms for the on-line traveling salesman
• Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles
• An improved lower bound for competitive graph exploration

This page was built for publication: Constructing competitive tours from local information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4630252)