论文信息 - Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems - 字舞流文

Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems

Abstract We describe approximation algorithms for the maximum transportation with permutable supply vector and related problems.

Esther M. Arkin | Refael Hassin | Maxim Sviridenko | Shlomi Rubinstein

[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2] Alexander Schrijver,et al. On the Size of Systems of Sets Every t of Which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems , 1989, SIAM J. Discret. Math..

[3] Barun Chandra,et al. Greedy local improvement and weighted set packing approximation , 2001, SODA '99.

[4] Esther M. Arkin,et al. On Local Search for Weighted k-Set Packing , 1998, Math. Oper. Res..

[5] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .

[6] Esther M. Arkin,et al. Approximating the maximum quadratic assignment problem , 2000, SODA '00.

[7] Thomas A. Feo,et al. A class of bounded approximation algorithms for graph partitioning , 1990, Networks.

[8] Gerhard J. Woeginger,et al. A note on the complexity of the transportation problem with a permutable demand vector , 1999, Math. Methods Oper. Res..

[9] L. Wolsey. Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems , 1982, Math. Oper. Res..

[10] Rainer E. Burkard,et al. A transportation problem with a permuted demand vector , 1999, Math. Methods Oper. Res..