Online variable sized covering

Leah Epstein

doi:10.1006/inco.2001.3087

Online variable sized covering

Leah Epstein

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

Abstract

The online problem of covering variable sized bins was discussed. One-dimensional and multidimensional vector covering with variable sized bins were considered. The best possible competitive ratio for the set of bins B and the parameter m by giving both an algorithm with competitive ratio r(B,m) and an upper bound of r(B,m) on the competitive ratio of any online deterministic or randomized algorithm was presented.

Original language	English
Pages (from-to)	294-305
Number of pages	12
Journal	Information and Computation
Volume	171
Issue number	2
DOIs	https://doi.org/10.1006/inco.2001.3087
State	Published - 15 Dec 2001
Externally published	Yes

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Computer Science Applications
Computational Theory and Mathematics

Access to Document

10.1006/inco.2001.3087

Cite this

@article{93f586f4cb6c45fe8498f3f45fe54bb2,

title = "Online variable sized covering",

abstract = "The online problem of covering variable sized bins was discussed. One-dimensional and multidimensional vector covering with variable sized bins were considered. The best possible competitive ratio for the set of bins B and the parameter m by giving both an algorithm with competitive ratio r(B,m) and an upper bound of r(B,m) on the competitive ratio of any online deterministic or randomized algorithm was presented.",

author = "Leah Epstein",

year = "2001",

month = dec,

day = "15",

doi = "10.1006/inco.2001.3087",

language = "English",

volume = "171",

pages = "294--305",

journal = "Information and Computation",

issn = "0890-5401",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - Online variable sized covering

AU - Epstein, Leah

PY - 2001/12/15

Y1 - 2001/12/15

N2 - The online problem of covering variable sized bins was discussed. One-dimensional and multidimensional vector covering with variable sized bins were considered. The best possible competitive ratio for the set of bins B and the parameter m by giving both an algorithm with competitive ratio r(B,m) and an upper bound of r(B,m) on the competitive ratio of any online deterministic or randomized algorithm was presented.

AB - The online problem of covering variable sized bins was discussed. One-dimensional and multidimensional vector covering with variable sized bins were considered. The best possible competitive ratio for the set of bins B and the parameter m by giving both an algorithm with competitive ratio r(B,m) and an upper bound of r(B,m) on the competitive ratio of any online deterministic or randomized algorithm was presented.

UR - https://www.scopus.com/pages/publications/0035895129

U2 - 10.1006/inco.2001.3087

DO - 10.1006/inco.2001.3087

M3 - Article

AN - SCOPUS:0035895129

SN - 0890-5401

VL - 171

SP - 294

EP - 305

JO - Information and Computation

JF - Information and Computation

IS - 2

ER -

Online variable sized covering

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this