Approximation algorithms for the bi-criteria weighted MAX-CUT problem

Discrete Applied Mathematics

Volumn 154, Issue 12, 2006, Pages 1685-1692

  Angel, Eric ^a   Bampis, Evripidis ^a   Gourvès, Laurent ^a  

^a UNIVERSITÉ D EVRY VAL D ESSONNE   (France)

Author keywords

Approximation algorithm; Bicriteria MAX CUT problem; Multicriteria optimization; Performance guarantee

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; PROBLEM SOLVING; RANDOM PROCESSES;

APPROXIMATION ALGORITHM; BICRITERIA MAX-CUT PROBLEM; MULTICRITERIA OPTIMIZATION; PERFORMANCE GUARANTEE;

GRAPH THEORY;

EID: 33646908919     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2006.02.008     Document Type: Article

References (15)

1. E. Angel, E. Bampis, A.V. Fishkin, A note on scheduling to meet two min-sum objectives, Proceedings of 9th International Workshop on Project Management and Scheduling (PMS'2004), 2004, pp. 143-146.
2. J. Aslam, A. Rasala, C. Stein, N. Young, Improved bicriteria existence theorems for scheduling, Proceedings of 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 1999, pp. 846-847.
3. Baille F., Bampis E., and Laforest C. A note on bicriteria schedules with optimal approximations ratios. Parallel Process. Lett. 14 (2004) 315-323
4. Bampis E., and Kononov A. Bicriteria approximation algorithms for scheduling problems with communications delays. J. Scheduling 8 4 (2005) 281-294
5. Barahona F., Grötschel M., Jünger M., and Reinelt G. An application of combinatorial optimization to statistical physics and circuit layout design. Oper. Res. 36 (1998) 493-513
6. Bruglieri M., Maffioli F., and Ehrgott M. Cardinality constrained minimum cut problems: complexity and algorithms. Discrete Appl. Math. 137 (2004) 311-341
7. M. Ehrgott, Multicriteria Optimization, Lecture Notes in Economics and Mathematical Systems N 491, Springer, Berlin, 2000.
8. M.X. Goemans, D.P. Williamson, .879-approximation algorithms for MAX CUT and MAX 2SAT, in: Proceedings of STOC, 1994, pp. 422-431.
9. Goemans M.X., and Williamson D.P. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42 6 (1995) 1115-1145
10. Hromkovič J. Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics (2001), Springer, Berlin
11. G. Jäger, A. Srivastav, Improved approximation algorithms for maximum graph partitioning problems, in: Proceedings of FSTTCS, 2004, pp. 348-359.
12. Karp R.M. Reducibility among combinatorial problems. In: Miller R., and Thatcher J. (Eds). Complexity of Computer Computations (1972), Plenum Press, NY 85-103
13. C.H. Papadimitriou, M. Yannakakis, On the approximability of trade-offs and optimal access of web sources, in: Proceedings of the 41th Annual IEEE Symposium on Foundations of Computer Science, 2000, pp. 86-92.
14. A. Rasala, C. Stein, E. Torng, P. Uthaisombut, Existence theorems, lower bounds and algorithms for scheduling to meet two objectives, in: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 723-731.
15. Stein C., and Wein J. On the existence of schedules that are near-optimal for both makespan and total weighted completion time. Oper. Res. Lett. 21 (1997) 115-122