IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v45y2023i4d10.1007_s10878-023-01036-3.html
   My bibliography  Save this article

Online bottleneck matching on a line

Author

Listed:
  • Man Xiao

    (Yunnan University)

  • Shu Zhao

    (Yunnan University)

  • Weidong Li

    (Yunnan University)

  • Jinhua Yang

    (Dianchi College)

Abstract

We study the online bottleneck matching problem on a line, which is to match a sequence of m requests arriving one-by-one in an online fashion to a given set of m servers, such that each server is matched exactly once and the maximum distance between any request and its server is minimized. When the distances between any two adjacent servers are the same, we present an optimal online algorithm with a competitive ratio of $$m+1$$ m + 1 . When $$m=3$$ m = 3 , we present an optimal online algorithm whose competitive ratio is determined by the relative distance between adjacent servers and no more than $$3+\sqrt{2}$$ 3 + 2 , which matches the previous best lower bound proposed thirty years ago.

Suggested Citation

  • Man Xiao & Shu Zhao & Weidong Li & Jinhua Yang, 2023. "Online bottleneck matching on a line," Journal of Combinatorial Optimization, Springer, vol. 45(4), pages 1-17, May.
    • Handle: RePEc:spr:jcomop:v:45:y:2023:i:4:d:10.1007_s10878-023-01036-3
    DOI: 10.1007/s10878-023-01036-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-023-01036-3
    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-023-01036-3?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. Barbara M. Anthony & Christine Chung, 2016. "Serve or skip: the power of rejection in online bottleneck matching," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 1232-1253, November.
    2. Barbara M. Anthony & Christine Chung, 2014. "Online bottleneck matching," Journal of Combinatorial Optimization, Springer, vol. 27(1), pages 100-114, January.
    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.
    1. Barbara M. Anthony & Christine Chung, 2016. "Serve or skip: the power of rejection in online bottleneck matching," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 1232-1253, November.
    2. Li, Jianbin & Zheng, Yuting & Dai, Bin & Yu, Jiang, 2020. "Implications of matching and pricing strategies for multiple-delivery-points service in a freight O2O platform," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 136(C).
    3. David Bergman & Jason Imbrogno, 2017. "Surviving a National Football League Survivor Pool," Operations Research, INFORMS, vol. 65(5), pages 1343-1354, October.

    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:45:y:2023:i:4:d:10.1007_s10878-023-01036-3. 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.