Primal-dual approximation algorithms for a packing-covering pair of problems

S Kovaleva^*, FCR Spieksma

^*Corresponding author for this work

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

Cite this

@article{5cb1fbc275d84bcc92dd2cf130589f68,

title = "Primal-dual approximation algorithms for a packing-covering pair of problems",

keywords = "primal-dual, approximation algorithms, packing-covering, intervals, THROUGHPUT",

author = "S Kovaleva and FCR Spieksma",

year = "2002",

doi = "10.1051/ro:2002005",

language = "English",

volume = "36",

pages = "53--71",

journal = "Rairo-Operations research",

issn = "0399-0559",

publisher = "EDP Sciences",

number = "1",

}

TY - JOUR

T1 - Primal-dual approximation algorithms for a packing-covering pair of problems

AU - Kovaleva, S

AU - Spieksma, FCR

PY - 2002

Y1 - 2002

KW - primal-dual

KW - approximation algorithms

KW - packing-covering

KW - intervals

KW - THROUGHPUT

U2 - 10.1051/ro:2002005

DO - 10.1051/ro:2002005

M3 - Article

VL - 36

SP - 53

EP - 71

JO - Rairo-Operations research

JF - Rairo-Operations research

SN - 0399-0559

IS - 1

ER -