
Search the dblp DataBase
Arjen P. A. Vestjens:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Noga Alon, János Csirik, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger
Online and Offline Approximation Algorithms for Vector Covering Problems. [Citation Graph (0, 0)][DBLP] ESA, 1996, pp:406418 [Conf]
 Han Hoogeveen, Arjen P. A. Vestjens
Optimal OnLine Algorithms for SingleMachine Scheduling. [Citation Graph (0, 0)][DBLP] IPCO, 1996, pp:404414 [Conf]
 Noga Alon, Yossi Azar, János Csirik, Leah Epstein, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger
OnLine and OffLine Approximation Algorithms for Vector Covering Problems. [Citation Graph (0, 0)][DBLP] Algorithmica, 1998, v:21, n:1, pp:104118 [Journal]
 Bo Chen, Arjen P. A. Vestjens, Gerhard J. Woeginger
OnLine Scheduling of TwoMachine Open Shops Where Jobs Arrive Over Time. [Citation Graph (0, 0)][DBLP] J. Comb. Optim., 1998, v:1, n:4, pp:355365 [Journal]
 Arjen P. A. Vestjens
Scheduling uniform machines online requires nondecreasing speed ratios. [Citation Graph (0, 0)][DBLP] Math. Program., 1998, v:82, n:, pp:225234 [Journal]
 Bo Chen, Arjen P. A. Vestjens
Scheduling on identical machines: How good is LPT in an online setting? [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 1997, v:21, n:4, pp:165169 [Journal]
 Leen Stougie, Arjen P. A. Vestjens
Randomized algorithms for online scheduling problems: how low can't you go? [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2002, v:30, n:2, pp:8996 [Journal]
 Han Hoogeveen, Arjen P. A. Vestjens
A Best Possible Deterministic OnLine Algorithm for Minimizing Maximum Delivery Time on a Single Machine. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2000, v:13, n:1, pp:5663 [Journal]
Search in 0.002secs, Finished in 0.003secs
