EFFICIENT ALGORITHMS FOR A SCHEDULING PROBLEM AND ITS APPLICATIONS TOILLICIT DRUG MARKET CRACKDOWNS

Authors
CAI P CAI JY NAIK AV
Citation
P. Cai et al., EFFICIENT ALGORITHMS FOR A SCHEDULING PROBLEM AND ITS APPLICATIONS TOILLICIT DRUG MARKET CRACKDOWNS, Journal of combinatorial optimization, 1(4), 1998, pp. 367-376
Citations number
12
Categorie Soggetti
Mathematics,"Computer Science Interdisciplinary Applications",Mathematics,"Computer Science Interdisciplinary Applications
Journal title
Journal of combinatorial optimization → ACNP
ISSN journal
13826905
Volume
1
Issue
4
Year of publication
1998
Pages
367 - 376
Database
ISI
SICI code
1382-6905(1998)1:4<367:EAFASP>2.0.ZU;2-B
Abstract
We give polynomial time algorithms for a job scheduling problem. By du ality we transform a special case of the drug market crackdown schedul ing problem to the above job scheduling problem and thus derive polyno mial time algorithms to the second problem. Finally, using the algorit hm for the special case, we develop a quasipolynomial time approximati on algorithm for the general case of the drug market crackdown schedul ing problem with monomial cost functions.