IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v48y2024i1d10.1007_s10878-024-01192-0.html
   My bibliography  Save this article

An improved upper bound for the online graph exploration problem on unicyclic graphs

Author

Listed:
  • Koji M. Kobayashi

    (The University of Tokyo)

  • Ying Li

    (The University of Tokyo)

Abstract

The online graph exploration problem, which was proposed by Kalyanasundaram and Pruhs (Theor Comput Sci 130(1):125–138, 1994), is defined as follows: Given an edge-weighted undirected connected graph and a specified vertex (called the origin), the task of an algorithm is to compute a path from the origin to the origin which contains all the vertices of the given graph. The goal of the problem is to find such a path of minimum weight. At each time, an online algorithm knows only the weights of edges each of which consists of visited vertices or vertices adjacent to visited vertices. Fritsch (Inform Process Lett 168:1006096, 2021) showed that the competitive ratio of an online algorithm is at most three for any unicyclic graph. On the other hand, Brandt et al. (Theor Comput Sci 839:176–185, 2020) showed a lower bound of two on the competitive ratio for any unicyclic graph. In this paper, we showed the competitive ratio of an online algorithm is at most 5/2 for any unicyclic graph.

Suggested Citation

  • Koji M. Kobayashi & Ying Li, 2024. "An improved upper bound for the online graph exploration problem on unicyclic graphs," Journal of Combinatorial Optimization, Springer, vol. 48(1), pages 1-38, August.
    • Handle: RePEc:spr:jcomop:v:48:y:2024:i:1:d:10.1007_s10878-024-01192-0
    DOI: 10.1007/s10878-024-01192-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-024-01192-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-024-01192-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Yuya Higashikawa & Naoki Katoh & Stefan Langerman & Shin-ichi Tanigawa, 2014. "Online graph exploration algorithms for cycles and trees by multiple searchers," Journal of Combinatorial Optimization, Springer, vol. 28(2), pages 480-495, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:48:y:2024:i:1:d:10.1007_s10878-024-01192-0. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.