Online labeling: algorithms, lower bounds and open questions
From MaRDI portal
(Redirected from Publication:1625136)
Recommendations
- Tight lower bounds for the online labeling problem
- Tight lower bounds for the online labeling problem
- On Online Labeling with Polynomially Many Labels
- On randomized online labeling with polynomially many labels
- On online labeling with large label set
- A Tight Lower Bound for Online Monotonic List Labeling
- scientific article; zbMATH DE number 7364985
- Online lower bounds via duality
- A tight lower bound for on-line monotonic list labeling
- Lower bounds for online bin covering-type problems
Cited in
(9)- The online house numbering problem: min-max online list labeling
- An Optimal Algorithm for Online Freeze-tag
- A tight lower bound for on-line monotonic list labeling
- A Tight Lower Bound for Online Monotonic List Labeling
- On randomized online labeling with polynomially many labels
- On online labeling with large label set
- Tight lower bounds for the online labeling problem
- Tight lower bounds for the online labeling problem
- On Online Labeling with Polynomially Many Labels
This page was built for publication: Online labeling: algorithms, lower bounds and open questions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1625136)