π
π
The Cartographer
A tight analysis of Kierstead-Trotter algorithm for online unit interval coloring
September 28, 2016 Β· Declared Dead Β· π IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Tetsuya Araki, Koji M. Kobayashi
arXiv ID
1609.09031
Category
cs.DS: Data Structures & Algorithms
Citations
0
Venue
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
Last Checked
5 months ago
Abstract
Kierstead and Trotter (Congressus Numerantium 33, 1981) proved that their algorithm is an optimal online algorithm for the online interval coloring problem. In this paper, for online unit interval coloring, we show that the number of colors used by the Kierstead-Trotter algorithm is at most $3 Ο(G) - 3$, where $Ο(G)$ is the size of the maximum clique in a given graph $G$, and it is the best possible.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted