Optimal deterministic (1.5-competitive) and randomized (11/9-competitive) online algorithms for graph embedding into star graphs, with matching lower bounds proving tightness.
The Itinerant List Update Problem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Online Graph Embedding in Star Graphs
Optimal deterministic (1.5-competitive) and randomized (11/9-competitive) online algorithms for graph embedding into star graphs, with matching lower bounds proving tightness.