On-line Adaptive Chain Covering of Upgrowing Posets

We analyze on-line chain partitioning problem and its variants as a two-person game. One person (Spoiler) builds an on-line poset presenting one point at time. The other one (Algorithm) assigns new point to a chain. Kierstead gave a strategy for Algorithm showing that width w posets can be on-line c...

Full description

Saved in:
Bibliographic Details
Published in:Discrete mathematics and theoretical computer science Vol. DMTCS Proceedings vol. AF,...; no. Proceedings; pp. 37 - 48
Main Authors: Bosek, Bartłomiej, Micek, Piotr
Format: Journal Article Conference Proceeding
Language:English
Published: DMTCS 01.01.2005
Discrete Mathematics and Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science
Series:DMTCS Proceedings
Subjects:
[info.info-hc] computer science [cs]/human-computer interaction [cs.hc]
[info.info-lo] computer science [cs]/logic in computer science [cs.lo]
[info.info-sc] computer science [cs]/symbolic computation [cs.sc]
chain partition
Computer Science
Human-Computer Interaction
Logic in Computer Science
on-line algorithm
order
poset
Symbolic Computation
chain partition
on-line algorithm
poset
order
ISSN:1365-8050, 1462-7264, 1365-8050
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract We analyze on-line chain partitioning problem and its variants as a two-person game. One person (Spoiler) builds an on-line poset presenting one point at time. The other one (Algorithm) assigns new point to a chain. Kierstead gave a strategy for Algorithm showing that width w posets can be on-line chain partitioned into $\frac{{5}^{w-1}}{4}$ chains. Felsner proved that if Spoiler presents an upgrowing poset, i.e., each new point is maximal at the moment of its arrival then there is a strategy for Algorithm using at most $\binom{w+1}{2}$ chains and it is best possible. An adaptive variant of this problem allows Algorithm to assign to the new point a set of chains and than to remove some of them (but not all) while covering next points. Felsner stated a hypothesis that in on-line adaptive chain covering of upgrowing posets Algorithm may use smaller number of chains than in non-adaptive version. In this paper we provide an argument suggesting that it is true. We present a class of upgrowing posets in which Spoiler has a strategy forcing Algorithm to use at least $\binom{w+1}{2}$ chains (in non-adaptive version) and Algorithm has a strategy using at most $O(w\sqrt{w})$ chains in adaptive version.
AbstractList We analyze on-line chain partitioning problem and its variants as a two-person game. One person (Spoiler) builds an on-line poset presenting one point at time. The other one (Algorithm) assigns new point to a chain. Kierstead gave a strategy for Algorithm showing that width w posets can be on-line chain partitioned into $\frac{{5}^{w-1}}{4}$ chains. Felsner proved that if Spoiler presents an upgrowing poset, i.e., each new point is maximal at the moment of its arrival then there is a strategy for Algorithm using at most $\binom{w+1}{2}$ chains and it is best possible. An adaptive variant of this problem allows Algorithm to assign to the new point a set of chains and than to remove some of them (but not all) while covering next points. Felsner stated a hypothesis that in on-line adaptive chain covering of upgrowing posets Algorithm may use smaller number of chains than in non-adaptive version. In this paper we provide an argument suggesting that it is true. We present a class of upgrowing posets in which Spoiler has a strategy forcing Algorithm to use at least $\binom{w+1}{2}$ chains (in non-adaptive version) and Algorithm has a strategy using at most $O(w\sqrt{w})$ chains in adaptive version.
Author Micek, Piotr
Bosek, Bartłomiej
Author_xml – sequence: 1
  givenname: Bartłomiej
  surname: Bosek
  fullname: Bosek, Bartłomiej
  organization: Algorithmics Research Group
– sequence: 2
  givenname: Piotr
  surname: Micek
  fullname: Micek, Piotr
  organization: Algorithmics Research Group
BackLink https://inria.hal.science/hal-01183337$$DView record in HAL
BookMark eNpVUMtqwzAQFCWFJmlP_QFfS3G6smRLPgbTRyCQHpqzkKVV4uBYQTIp_fs6SSkte9jdYXaGnQkZdb5DQu4pzHiRlfLJ7nsTZ4wLdkXGlBV5KiGH0Z_5hkxi3AHQrORiTNiqS9umw2Ru9aFvjphUW910SeWPGJpuk3iXrA-b4D9Py7uP2Mdbcu10G_Hup0_J-uX5o3pLl6vXRTVfpoYKxlKB0taycLbUUtZ5KQViLlhpALS2yGUmQECZYQ2QYwGZhmIom1mtwVDJpmRx0bVe79QhNHsdvpTXjToDPmyUDn1jWlTDe84xTusccw6DQcmROsEAkFttzKD1cNHa6vaf1Nt8qU4Y0MGRMXGkA_fxwjXBxxjQ_R5QUOec1TlndcqZfQP1fnAy
ContentType Journal Article
Conference Proceeding
Copyright Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml – notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID AAYXX
CITATION
1XC
VOOES
DOA
DOI 10.46298/dmtcs.3473
DatabaseName CrossRef
Hyper Article en Ligne (HAL)
Hyper Article en Ligne (HAL) (Open Access)
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
EndPage 48
ExternalDocumentID oai_doaj_org_article_136ff341b5e54000a94e1f7300e4dacc
oai:HAL:hal-01183337v1
10_46298_dmtcs_3473
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
BCNDV
BENPR
BFMQW
BGLVJ
BPHCQ
C1A
CCPQU
CITATION
EAP
EBS
ECS
EDO
EJD
EMK
EPL
EST
ESX
GROUPED_DOAJ
HCIFZ
I-F
IAO
ICD
J9A
KQ8
L6V
LO0
M7S
MK~
ML~
OK1
OVT
P2P
PHGZM
PHGZT
PIMPY
PQGLB
PQQKQ
PROAC
PTHSS
REM
RNS
RSU
TR2
TUS
XSB
~8M
1XC
VOOES
ID FETCH-LOGICAL-c1733-7e8db86fd9a88b5987ee5739c00aade482707092eb005e602a06060d2daa0c183
IEDL.DBID DOA
ISSN 1365-8050
1462-7264
IngestDate Fri Oct 03 12:29:11 EDT 2025
Tue Oct 14 20:46:14 EDT 2025
Sat Nov 29 02:48:25 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue Proceedings
Keywords chain partition
on-line algorithm
poset
order
Language English
License Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel DirectLink
MeetingName Computational Logic and Applications, CLA '05
MergedId FETCHMERGED-LOGICAL-c1733-7e8db86fd9a88b5987ee5739c00aade482707092eb005e602a06060d2daa0c183
OpenAccessLink https://doaj.org/article/136ff341b5e54000a94e1f7300e4dacc
PageCount 12
ParticipantIDs doaj_primary_oai_doaj_org_article_136ff341b5e54000a94e1f7300e4dacc
hal_primary_oai_HAL_hal_01183337v1
crossref_primary_10_46298_dmtcs_3473
PublicationCentury 2000
PublicationDate 2005-01-01
PublicationDateYYYYMMDD 2005-01-01
PublicationDate_xml – month: 01
  year: 2005
  text: 2005-01-01
  day: 01
PublicationDecade 2000
PublicationSeriesTitle DMTCS Proceedings
PublicationTitle Discrete mathematics and theoretical computer science
PublicationYear 2005
Publisher DMTCS
Discrete Mathematics and Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science
Publisher_xml – name: Discrete Mathematics and Theoretical Computer Science
– name: DMTCS
– name: Discrete Mathematics & Theoretical Computer Science
SSID ssj0012947
ssib044734695
Score 1.5927306
Snippet We analyze on-line chain partitioning problem and its variants as a two-person game. One person (Spoiler) builds an on-line poset presenting one point at time....
SourceID doaj
hal
crossref
SourceType Open Website
Open Access Repository
Index Database
StartPage 37
SubjectTerms [info.info-hc] computer science [cs]/human-computer interaction [cs.hc]
[info.info-lo] computer science [cs]/logic in computer science [cs.lo]
[info.info-sc] computer science [cs]/symbolic computation [cs.sc]
chain partition
Computer Science
Human-Computer Interaction
Logic in Computer Science
on-line algorithm
order
poset
Symbolic Computation
Title On-line Adaptive Chain Covering of Upgrowing Posets
URI https://inria.hal.science/hal-01183337
https://doaj.org/article/136ff341b5e54000a94e1f7300e4dacc
Volume DMTCS Proceedings vol. AF,...
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: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044734695
  issn: 1365-8050
  databaseCode: M~E
  dateStart: 19980101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– 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/eLvHCXMwrV07T8MwED4hYICBN6I8qgixBpI4ie2xVKAiUegAEkyRH2dgoK1IYeS3c3ZSBBMLSyRbURJ9l3vZvu8ATrSVBfkNFaNhZZwLzWONKMNQ-EJQ40RoNsFvbsTDgxz9aPXlz4Q19MANcGcpK50jU6sLpOAiSZTMMXWeZR1zq4zx1peinnky1e4fZDLnTTVeXmZSnNnXmalPWc7ZL_8TaPrJqzzPV1GDV7ncgLU2HIx6zWdswgKOt2B93mohajVvC1aH3_Sq9Taw23Hsw8OoZ9XU26uo_0wZftT35zHJF0UTF91PnyjD9oPRpMZZvQP3lxd3_UHcdj-ITcoZizkKq0XprFRC6EIKjlhwJg1hoCx6-k5SV5n55j8FlkmmEkpGEptZpRJDmroLi-PJGPcgEkhRVEqpl8tsrlmprSux9GRwKAvpdAdO5phU04bkoqLkIEBXBegqD10Hzj1e37d4ZuowQfKqWnlVf8mrA8eE9q9nDHrXlZ_zRbCMMf6R7v_Hmw5gJfCshvWSQ1icvb3jESybj9lL_dYN_wtdh58XXVgaXQ1Hj18XicbF
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=proceeding&rft.title=Discrete+mathematics+and+theoretical+computer+science&rft.atitle=On-line+Adaptive+Chain+Covering+of+Upgrowing+Posets&rft.au=Bosek%2C+Bart%C5%82omiej&rft.au=Micek%2C+Piotr&rft.series=DMTCS+Proceedings&rft.date=2005-01-01&rft.pub=DMTCS&rft.issn=1462-7264&rft.eissn=1365-8050&rft.volume=DMTCS+Proceedings+vol.+AF%2C+Computational+Logic+and+Applications+%28CLA+%2705%29&rft.spage=37&rft.epage=48&rft_id=info:doi/10.46298%2Fdmtcs.3473&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=oai%3AHAL%3Ahal-01183337v1
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