PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Vestjens, Arjen P. A."

Author of the publication

copydeleteadd this publication to your clipboard
On-Line and Off-Line Approximation Algorithms for Vector Covering Problems.

, , , , , , and . Algorithmica, 21 (1): 104-118 (1998)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

A. Laukemann

A. Laukemann

A. Laukemann

A. Vo{\ss}

A. Afkari

 

Other publications of authors with the same name

Constrained Maximin Designs for Computer Experiments., , , and . Technometrics, 45 (4): 340-346 (2003)Randomized algorithms for on-line scheduling problems: how low can't you go?, and . Oper. Res. Lett., 30 (2): 89-96 (2002)On-line and Off-line Approximation Algorithms for Vector Covering Problems., , , , and . ESA, volume 1136 of Lecture Notes in Computer Science, page 406-418. Springer, (1996)On-Line Scheduling of Two-Machine Open Shops Where Jobs Arrive Over Time., , and . J. Comb. Optim., 1 (4): 355-365 (1998)Complexity of the job insertion problem in multi-stage scheduling., , and . Oper. Res. Lett., 35 (6): 754-758 (2007)Scheduling uniform machines on-line requires nondecreasing speed ratios.. Math. Program., (1998)Scheduling on identical machines: How good is LPT in an on-line setting?, and . Oper. Res. Lett., 21 (4): 165-169 (1997)Optimal On-Line Algorithms for Single-Machine Scheduling., and . IPCO, volume 1084 of Lecture Notes in Computer Science, page 404-414. Springer, (1996)On-Line and Off-Line Approximation Algorithms for Vector Covering Problems., , , , , , and . Algorithmica, 21 (1): 104-118 (1998)A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine., and . SIAM J. Discrete Math., 13 (1): 56-63 (2000)