On the Advice Complexity of Online Matching on the Line

We consider the matching problem on the line with advice complexity. We give a 1-competitive online algorithm with advice complexity $n-1,$ and show that there is no 1-competitive online algorithm reading less than $n-1$ bits of advice. Moreover, for each $0<k<n$ we present a $c(n/k)$-competit...

Full description

Saved in:
Bibliographic Details
Published in:Discrete mathematics and theoretical computer science Vol. 26:3; no. Discrete Algorithms
Main Authors: Csaba, Béla, Nagy-György, Judit
Format: Journal Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 01.01.2024
Subjects:
computer science - data structures and algorithms
ISSN:1365-8050, 1365-8050
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract We consider the matching problem on the line with advice complexity. We give a 1-competitive online algorithm with advice complexity $n-1,$ and show that there is no 1-competitive online algorithm reading less than $n-1$ bits of advice. Moreover, for each $0<k<n$ we present a $c(n/k)$-competitive online algorithm with advice complexity $O(k(\log N + \log n))$ where $n$ is the number of servers, $N$ is the distance of the minimal and maximal servers, and $c(n)$ is the complexity of the best online algorithm without advice.
AbstractList We consider the matching problem on the line with advice complexity. We give a 1-competitive online algorithm with advice complexity $n-1,$ and show that there is no 1-competitive online algorithm reading less than $n-1$ bits of advice. Moreover, for each $0<k<n$ we present a $c(n/k)$-competitive online algorithm with advice complexity $O(k(\log N + \log n))$ where $n$ is the number of servers, $N$ is the distance of the minimal and maximal servers, and $c(n)$ is the complexity of the best online algorithm without advice.
Author Nagy-György, Judit
Csaba, Béla
Author_xml – sequence: 1
  givenname: Béla
  surname: Csaba
  fullname: Csaba, Béla
– sequence: 2
  givenname: Judit
  surname: Nagy-György
  fullname: Nagy-György, Judit
BookMark eNpNkF1LwzAUhoNMcJve-QP6A-w8SdMmuRxD3WCyG70O-TjZMrpmtEXcv7d0IsKB9_Cew3PxzMikSQ0S8khhwSum5LM_9a5bUE5ZeUOmtKjKXEIJk3_7HZl13RGAMsXFlIhdk_UHzJb-KzrMVul0rvE79pcshWzX1LHB7N307hCbfZauv9uhvCe3wdQdPvzmnHy-vnys1vl297ZZLbe5Y6rqc-GskN6WyknJITgEhYFTjsEFhGAteAbcAjILCpgwomIsAIQhqZNVMSebK9cnc9TnNp5Me9HJRD0Wqd1r0_bR1aiZF0WhhrHMcGODwdJRJqAoPZNquM3J05Xl2tR1LYY_HgU9CtSjQD0KLH4AZIdkbA
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.46298/dmtcs.14125
DatabaseName CrossRef
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList
CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: Open Access: DOAJ - Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EISSN 1365-8050
ExternalDocumentID oai_doaj_org_article_2d7339339b2a4abfae5c127035d28973
10_46298_dmtcs_14125
GroupedDBID -~9
.4S
.DC
29G
2WC
5GY
5VS
8FE
8FG
AAFWJ
AAYXX
ABDBF
ABJCF
ABUWG
ACGFO
ACIWK
ACUHS
ADBBV
ADQAK
AENEX
AFFHD
AFKRA
AFPKN
AIAGR
ALMA_UNASSIGNED_HOLDINGS
AMVHM
ARCSS
B0M
BAIFH
BBTPI
BCNDV
BENPR
BFMQW
BGLVJ
BPHCQ
CCPQU
CITATION
EAP
EBS
ECS
EDO
EJD
EMK
EPL
EST
ESX
GROUPED_DOAJ
HCIFZ
I-F
IAO
IBB
ICD
ITC
J9A
KQ8
KWQ
L6V
M7S
MK~
ML~
OK1
OVT
P2P
PHGZM
PHGZT
PIMPY
PQGLB
PQQKQ
PROAC
PTHSS
PV9
REM
RNS
RSU
RZL
TR2
TUS
XSB
~8M
ID FETCH-LOGICAL-c296t-7cb78db59c8840fce09ef414efcfe0fbb0d204b0e2b09027a7622f00f7621c863
IEDL.DBID DOA
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001382651600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1365-8050
IngestDate Fri Oct 03 12:51:26 EDT 2025
Sat Nov 29 02:48:27 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue Discrete Algorithms
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c296t-7cb78db59c8840fce09ef414efcfe0fbb0d204b0e2b09027a7622f00f7621c863
OpenAccessLink https://doaj.org/article/2d7339339b2a4abfae5c127035d28973
ParticipantIDs doaj_primary_oai_doaj_org_article_2d7339339b2a4abfae5c127035d28973
crossref_primary_10_46298_dmtcs_14125
PublicationCentury 2000
PublicationDate 2024-01-01
PublicationDateYYYYMMDD 2024-01-01
PublicationDate_xml – month: 01
  year: 2024
  text: 2024-01-01
  day: 01
PublicationDecade 2020
PublicationTitle Discrete mathematics and theoretical computer science
PublicationYear 2024
Publisher Discrete Mathematics & Theoretical Computer Science
Publisher_xml – name: Discrete Mathematics & Theoretical Computer Science
SSID ssj0012947
Score 2.2827756
Snippet We consider the matching problem on the line with advice complexity. We give a 1-competitive online algorithm with advice complexity $n-1,$ and show that there...
SourceID doaj
crossref
SourceType Open Website
Index Database
SubjectTerms computer science - data structures and algorithms
Title On the Advice Complexity of Online Matching on the Line
URI https://doaj.org/article/2d7339339b2a4abfae5c127035d28973
Volume 26:3
WOSCitedRecordID wos001382651600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: Open Access: DOAJ - Directory of Open Access Journals
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: DOA
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVPQU
  databaseName: Continental Europe Database
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: BFMQW
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/conteurope
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: M7S
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: BENPR
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Publicly Available Content Database
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: PIMPY
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELYQMMDAo4Aoj8oDjFEdx43tsSAqGFo6gFSmyE-JgRS1AYl_z9lOq24sTFGiSxR9F_vusy_fIXQjfW6YUCQzvACC4r3NggR0ppSkFuI7BG0fm03wyUTMZnK60eor1IQleeAEXJ9aXhTAuqWmiintlRuYsFtaDCxwBR51PiHrWZGpdv-ASsZTmTsrqRR9-9GYJcwKeWiJvRGANnT6Y0AZHaGDNhPEw_QGx2jL1R10uOqygNtB10H747Wy6vIE8ecawyke2jDEcTAPkpbND557nHRDMdwQKyTxPNkC33Sn6HX08HL_mLXNDzJDZdlk3GgurB5II4CDeeOIdJ7lzHnjHfFaE0sJ08RRHUoruYJZjXpCPBxzI8riDG3X89qdI8ytYIIw6wwPv6ISSFGc9Y4qaRgMwLKLbleIVJ9J46ICbhCRqyJyVUSui-4CXGuboEwdL4C_qtZf1V_-uviPh1yiPQrJRVoKuULbzeLLXaNd8928Lxe9-Cn00M70aTx9-wVj-Ll3
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+the+Advice+Complexity+of+Online+Matching+on+the+Line&rft.jtitle=Discrete+mathematics+and+theoretical+computer+science&rft.au=B%C3%A9la+Csaba&rft.au=Judit+Nagy-Gy%C3%B6rgy&rft.date=2024-01-01&rft.pub=Discrete+Mathematics+%26+Theoretical+Computer+Science&rft.eissn=1365-8050&rft.volume=26%3A3&rft.issue=Discrete+Algorithms&rft_id=info:doi/10.46298%2Fdmtcs.14125&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_2d7339339b2a4abfae5c127035d28973
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1365-8050&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1365-8050&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1365-8050&client=summon