Online interval coloring with packing constraints

Leah Epstein; Meital Levy

doi:10.1016/j.tcs.2008.05.018

Online interval coloring with packing constraints

Leah Epstein, Meital Levy

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

We study online interval coloring problems with bandwidth. We are interested in some variants motivated by bin packing problems. Specifically we consider open-end coloring, cardinality constrained coloring, coloring with vector constraints and finally a combination of both the cardinality and the vector constraints. We construct competitive algorithms for each of the variants. Additionally, we present a lower bound of 24/7 for interval coloring with bandwidth, which holds for all the above models, and improves the current lower bound for the standard interval coloring with bandwidth problem.

Original language	English
Pages (from-to)	203-212
Number of pages	10
Journal	Theoretical Computer Science
Volume	407
Issue number	1-3
DOIs	https://doi.org/10.1016/j.tcs.2008.05.018
State	Published - 6 Nov 2008

Keywords

Bin packing
Interval coloring
Online algorithms

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1016/j.tcs.2008.05.018

Cite this

@article{f79768c540a744b1aec1eefb1f2ca4b0,

title = "Online interval coloring with packing constraints",

abstract = "We study online interval coloring problems with bandwidth. We are interested in some variants motivated by bin packing problems. Specifically we consider open-end coloring, cardinality constrained coloring, coloring with vector constraints and finally a combination of both the cardinality and the vector constraints. We construct competitive algorithms for each of the variants. Additionally, we present a lower bound of 24/7 for interval coloring with bandwidth, which holds for all the above models, and improves the current lower bound for the standard interval coloring with bandwidth problem.",

keywords = "Bin packing, Interval coloring, Online algorithms",

author = "Leah Epstein and Meital Levy",

year = "2008",

month = nov,

day = "6",

doi = "10.1016/j.tcs.2008.05.018",

language = "English",

volume = "407",

pages = "203--212",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

number = "1-3",

}

TY - JOUR

T1 - Online interval coloring with packing constraints

AU - Epstein, Leah

AU - Levy, Meital

PY - 2008/11/6

Y1 - 2008/11/6

N2 - We study online interval coloring problems with bandwidth. We are interested in some variants motivated by bin packing problems. Specifically we consider open-end coloring, cardinality constrained coloring, coloring with vector constraints and finally a combination of both the cardinality and the vector constraints. We construct competitive algorithms for each of the variants. Additionally, we present a lower bound of 24/7 for interval coloring with bandwidth, which holds for all the above models, and improves the current lower bound for the standard interval coloring with bandwidth problem.

AB - We study online interval coloring problems with bandwidth. We are interested in some variants motivated by bin packing problems. Specifically we consider open-end coloring, cardinality constrained coloring, coloring with vector constraints and finally a combination of both the cardinality and the vector constraints. We construct competitive algorithms for each of the variants. Additionally, we present a lower bound of 24/7 for interval coloring with bandwidth, which holds for all the above models, and improves the current lower bound for the standard interval coloring with bandwidth problem.

KW - Bin packing

KW - Interval coloring

KW - Online algorithms

UR - http://www.scopus.com/inward/record.url?scp=53249095675&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2008.05.018

DO - 10.1016/j.tcs.2008.05.018

M3 - Article

AN - SCOPUS:53249095675

SN - 0304-3975

VL - 407

SP - 203

EP - 212

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 1-3

ER -

Online interval coloring with packing constraints

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this