A new rounding procedure for the assignment problem with applications to dense graph arrangement problems

Mathematical Programming, Series B

Volumn 92, Issue 1, 2002, Pages 1-36

  Arora, Sanjeev ^a   Frieze, Alan ^b   Kaplan, Haim ^c  

^a Princeton University   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ASSIGNMENT PROBLEM; FRACTIONAL MATCHING; FRACTIONAL SOLUTIONS; POLYNOMIAL TIME APPROXIMATION;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

GRAPH THEORY;

EID: 3142748958     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070100271     Document Type: Article

References (39)

1. [A99] Afrati, F., Bampis, E., Chekuri, C., Karger, D., Kenyon, C., Khanna, S., Mills, I., Queyranne, M., Skutella, M., Stein, C., Sviridenko, M. (1999): Approximation schemes for Minimizing Average Weighted Completion Time with Release dates. In: Proceedings of the 40th FOCS, pp. 32-43. IEEE
2. [AS92] Alon, N., Spencer, J.H. (1992): The Probabilistic Method. John Wiley and Sons, New York
3. [A96] Arora, S. (1998): Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and other Geometric Problems. JACM 45(5), 753-782
4. [AFK96] Arora, S., Frieze, A.M., Kaplan, H. (1996): A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems. In: Proceedings of the 37th FOCS, pp. 21-30. IEEE
5. [AKK95] Arora, S., Karger, D., Karpinski, M. (1999): Polynomial-time approximation schemes for dense instances of NP-hard optimization problems. JCSS 58(1), 193-210
6. [ALM+92] Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M. (1999): Proof verification and hardness of approximation problems. JACM 45(3), 501-555
7. [B94] Baker, B.S. (1994): Approximation Algorithms for NP-complete problems in planar graphs. JACM 41, 153-180
8. c n-wise Independence in NC. JACM 38(4), 1026-1046
9. [B98] Bollobás, B. (1998): Modern Graph Theory. Springer, Graduate Texts in Mathematics 184, New York
10. [BC96] Burkard, R.E., Cela, E. (1997): Quadratic and Three-Dimensional Assignments: An Annotated Bibliography. In: Dell'Amico, M., Maffioli, F., Martello, S., eds., Annotated Bibliographies in Combinatorial Optimization. Wiley, Chichester, pp. 373-392
11. [CK00] Chekuri, C., Khanna, S.: A PTAS for the Multiple Knapsack Problem. In: Proceedings of the 11th SODA, pp. 213-222
12. [Cohen93] Cohen, E. (1995): Approximate max-flow on small depth networks. SIAM J. Comput. 23(3), 579-597
13. [FdlV94] Fernandez de la Vega, W. (1996): MAXCUT has a randomized approximation scheme in dense graphs. Random Structures & Algorithms 8(3), 187-198
14. [FL81] Fernandez de la Vega, W., Lueker, G.S. (1981): Bin packing can be solved within 1+∈ in linear time. Combinatorica 1(4), 349-355
15. [FGHP93] Fisher, T., Goldberg, A.V., Haglin, D.J., Plotkin, S. (1993): Approximating matchings in parallel. Information Processing letters 46, 115-118
16. [FK96] Frieze, A., Kannan, R. (1996): The regularity lemma and approximation schemes for dense problems. In: Proceedings of the 37th FOCS, pp. 12-20. IEEE
17. [FK99] Frieze, A.M., Kannan, R. (1999): Quick approximation to matrices and applications. Combinatorica 19, 175-220
18. [Gil98] Gillman, D. (1998): A Chernoff bound for random walks on expanders. SIAM J. Comput. 27, 1203-1220
19. [GPST92] Goldberg, A.V., Plotkin, S.A., Shmoys, D., Tardos, E. (1991): Interior-Point Methods in Parallel Computation. SIAM J. Comput. 21(1), 149-150
20. [GGR96] Goldreich, O., Goldwasser, S., Ron, D. (1998): Property testing and its connection to learning and approximation. JACM 45(4), 653-750
21. [H64] Hoeffding, W. (1963): Probability inequalities for sums of bounded random variables. Journal of the American Stastical Association 58, 13-30
22. [IK75] Ibarra, O.H., Kim, C.E. (1975): Fast approximation algorithms for the knapsack and sum of subsets problems. JACM 22(4), 463-168
23. [KK82] Karmarkar, N., Karp, R.M. (1982): An efficient approximation scheme for the one-dimensional bin-packing problem. In: Proc. 23rd FOCS, pp. 312-320. IEEE
24. [KUW86] Karp, R.M., Upfal, E., Wigderson, A. (1986): Constructing a perfect matching is in random NC. Combinatorica 6(1), 35-48
25. [KM96] Khanna, S., Motwani, R. (1996): Towards a syntactic characterization of PTAS. In: Proc. 28th STOC, pp. 329-337. ACM
26. [Law76] Lawler, E. (1976): Combinatorial Optimization: Networks and Matroids. Holt, Rinehart, Winston, Fort Worth TX
27. [LR88] Leighton, T., Rao, S. (1999): Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. JACM 46(6), 787-832
28. [LPV81] Lev, G.F., Pippenger, N., Valiant, L. (1981): A Fast Parallel Algorithm for Routing in Permutation Networks. In: IEEE Trans. Computers C-30(2), 93-100
29. [LPS88] Lubotzky, A., Phillips, R., Sarnak, P. (1988): Ramanujan graphs. Combinatorica 8(3), 261-277
30. [LN92] Luby, M., Nisan, N. (1993): A parallel approximation algorithm for positive linear programming. In: Proc. 25th STOC, pp. 448-457. ACM
31. [MVV87] Mulmuley, K., Vazirani, U., Vazirani, V.V. (1987): Matching is as easy as matrix inversion. Combinatorica 7(1), 105-113
32. [PRW94] Pardalos, P.M., Rendl, F., Wolkowicz, H. (1994): The quadratic assignment problem: a survey of recent developments. In: Pardalos, P., Wolkowicz, H., eds., Quadratic assignment and related problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science Vol. 16, pp. 1-42
33. [R88] Raghavan, P. (1988): Probabilistic construction of deterministic algorithms: Approximating packing integer programs. JCSS 37(2), 130-43
34. [RT87] Raghavan, P., Thompson, C. (1987): Randomized Rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7, 365-374
35. [RT98] Rolim, J.D.P., Trevisan, L. (1998): A Case Study of De-randomization Methods for Combinatorial Approximation Problems. Journal of Combinatorial Optimization 2(3), 219-236
36. [SG76] Sahni, S., Gonzales, T. (1976): P-complete approximation problems. JACM 23, 555-565
37. [S78] Szemerédi, E. (1978): Regular partitions of graphs. In: Bermond, J.C., Fournier, J.C., Las Vergnas, M., Sotteau, D., eds., Proc. Colloque Inter. CNRS No. 260, pp. 399-401
38. [ST93] Shmoys, D.B., Tardos, E. (1993): An approximation algorithm for the generalized assignment problem. Math. Program. 62, 461-174
39. [SG93] Spirakis, P., Gibbons, A. (1993): PRAM models and fundamental parallel algorithmic techniques: Part I. In: Gibbons, A., Spirakis, P., eds., Lectures in Parallel Computation. Cambridge University Press, 1993.