|
Search the dblp DataBase
Arjen P. A. Vestjens:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Noga Alon, János Csirik, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger
On-line and Off-line Approximation Algorithms for Vector Covering Problems. [Citation Graph (0, 0)][DBLP] ESA, 1996, pp:406-418 [Conf]
- Han Hoogeveen, Arjen P. A. Vestjens
Optimal On-Line Algorithms for Single-Machine Scheduling. [Citation Graph (0, 0)][DBLP] IPCO, 1996, pp:404-414 [Conf]
- Noga Alon, Yossi Azar, János Csirik, Leah Epstein, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger
On-Line and Off-Line Approximation Algorithms for Vector Covering Problems. [Citation Graph (0, 0)][DBLP] Algorithmica, 1998, v:21, n:1, pp:104-118 [Journal]
- Bo Chen, Arjen P. A. Vestjens, Gerhard J. Woeginger
On-Line Scheduling of Two-Machine Open Shops Where Jobs Arrive Over Time. [Citation Graph (0, 0)][DBLP] J. Comb. Optim., 1998, v:1, n:4, pp:355-365 [Journal]
- Arjen P. A. Vestjens
Scheduling uniform machines on-line requires nondecreasing speed ratios. [Citation Graph (0, 0)][DBLP] Math. Program., 1998, v:82, n:, pp:225-234 [Journal]
- Bo Chen, Arjen P. A. Vestjens
Scheduling on identical machines: How good is LPT in an on-line setting? [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 1997, v:21, n:4, pp:165-169 [Journal]
- Leen Stougie, Arjen P. A. Vestjens
Randomized algorithms for on-line scheduling problems: how low can't you go? [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2002, v:30, n:2, pp:89-96 [Journal]
- Han Hoogeveen, Arjen P. A. Vestjens
A Best Possible Deterministic On-Line 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:56-63 [Journal]
Search in 0.001secs, Finished in 0.002secs
|