Weighted nearest neighbor algorithms for the graph exploration problem on cycles
From MaRDI portal
Publication:990116
DOI10.1016/J.IPL.2009.10.013zbMATH Open1206.68369OpenAlexW2032799093MaRDI QIDQ990116FDOQ990116
Authors: Yuichi Asahiro, Eiji Miyano, Shuichi Miyazaki, Takuro Yoshimuta 
Publication date: 2 September 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.10.013
Recommendations
- Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles
- scientific article; zbMATH DE number 7561542
- Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs
- Worst case analysis of nearest neighbour algorithms for the minimum weighted directed \(k\)-cycle problem
- Improved Approximation Algorithms for Weighted Hypergraph Embedding in a Cycle
- scientific article; zbMATH DE number 7310218
- Algorithms for finding the minimum cycle mean in the weighted directed graph
- scientific article; zbMATH DE number 4101240
- On nearest-neighbor graphs
- On nearest-neighbor graphs
Online algorithms; streaming algorithms (68W27) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- How to learn an unknown environment. I
- Shortest paths without a map
- The polygon exploration problem
- Title not available (Why is that?)
- Algorithms for the on-line travelling salesman
- Constructing competitive tours from local information
- Tree exploration with little memory
- Exploring Unknown Environments
- Algorithms – ESA 2005
- ONLINE ROUTING IN CONVEX SUBDIVISIONS
- Title not available (Why is that?)
- Impact of memory size on graph exploration capability
Cited In (6)
- An improved lower bound for competitive graph exploration
- Online Graph Exploration: New Results on Old and New Algorithms
- Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles
- Online graph exploration on a restricted graph class: optimal solutions for tadpole graphs
- Online graph exploration: New results on old and new algorithms
- An improved upper bound for the online graph exploration problem on unicyclic graphs
This page was built for publication: Weighted nearest neighbor algorithms for the graph exploration problem on cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990116)
