Download:
|
by Jiawei Zhang, Yinyu Ye
ftp://dollar.biz.uiowa.edu/pub/yyye/twocap1.ps
Add To MetaCart
Abstract:
Keywords: analysis of algorithm, Max-Cut, parallel machine scheduling.
Citations
|
121
|
Improved approximation algorithms for max k-cut and max bisection
– Frieze, Jerrum
- 1995
|
|
56
|
1976]. Algorithms for scheduling independent tasks
– Sahni
- 2000
|
|
35
|
The budgeted maximum coverage problem
– Khuller, Moss, et al.
- 1999
|
|
31
|
A .699-approximation algorithm for Max-Bisection
– Ye
- 1999
|
|
29
|
Approximation algorithms for maximum coverage and max cut with given sizes of parts
– Ageev, Sviridenko
- 1999
|
|
13
|
Current trends in deterministic scheduling
– Lee, Lei, et al.
- 1997
|
|
13
|
Semidefinite Relaxations for Parallel Machine Scheduling
– Skutella
- 1998
|
|
9
|
Machine scheduling with availability constraints
– Sanlaville, Schmidt
- 1998
|
|
8
|
Improved approximation algorithms for maximum graph bisection problems
– Halperin, Zwick
- 2000
|
|
6
|
Capacitated two-parallel machines scheduling to minimize sum of job completion times
– Lee, Liman
- 1993
|
|
3
|
Approximation algorithms for maximum linear arrangement
– Hassin, Rubinstein
- 1999
|
|
1
|
Using Homogeneous Weights for Approximating the
– Bar-Yehuda
|
|
1
|
An improved rounding method and semidefinite relaxation for graph partition," Working
– Han, Ye, et al.
- 2000
|
|
1
|
Minimization of the Mean Flow Time of Jobs on Two Parallel Machines with a Machine Availability Constraint," Working Paper 89-104
– Kao, Elsayed
- 1989
|
|
1
|
An Approximation Algorithm for the Two-Parallel Machines Scheduling Problem with Capacity Constraints", Working
– Yang, Ye, et al.
- 2000
|
