Optimizing misdirection

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 192-201

  Berman, Piotr ^a   Krysta, Piotr ^b  

^a The Pennsylvania State University   (United States)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; OPTIMIZATION; POLYNOMIALS; SET THEORY;

APPROXIMATION RATIO; MISDIRECTED CRITERION;

GRAPH THEORY;

EID: 0038416101     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. P. Alimonti and V. Kann, Hardness of approximating problems on cubic graphs, Theoretical Computer Science 237:123-134, 2000.
2. N. Alon, U. Feige, A. Wigderson and D. Zuckerman, Derandomized graph products. Computational Complexity 5, 60-75, 1995.
3. E. M. Arkin and R. Hassin, On local search for weighted k-set packing, ESA '97, Lecture Notes in Computer Science 1284, Springer, 1997.
4. V. Bafna, B. Narayana and R. Ravi, Nonoverlapping local alignments (Weighted independent sets of axis-parallel rectangles). Discrete Applied Mathematics, 71, Special issue on Computational Molecular Biology, pp. 41-53, 1996. Prelim. version in WADS 1995.
5. P. Berman, A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs, Nordic Journal of Computing 7(3): 178-184, 2000.
6. B. Chandra and M. M. Halldórsson, Greedy local improvement and weighted packing approximation, SODA 1999.
7. S. de Vries and R. Vohra, Combinatorial Auctions: A Survey. Manuscript, January 12th, 2001. Available at http://citeseer.nj.nec.com
8. M. M. Halldórsson, Approximations of Independent Sets in Graphs, Approximation Algorithms for Combinatorial Optimization, International Workshop APPROX, LNCS 1444: 1-13, 1998.
9. M. M. Halldórsson and H. C. Lau, Low-degree graph partitioning via local search with applications to constraint satisfaction, max cut, and 3-coloring, J. Graph Algorithms & Applications 1(3): 1-13, 1997.
10. 1-ε, FOCS '96, pp. 627-363, 1996.
11. D. S. Hochbaum, Efficient bounds for the stable set, vertex cover, and set packing problems, Discrete Applied Mathematics 6: 243-254, 1983.
12. C. A. Hurkens and A. Schrijver, One the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio heuristics for packing problems, SIAM J. Discr. Math. 2(1): 68-72, Feb. 1989.
13. D. Nakamura and A. Tamura, A revision of Minty's algorithm for finding a maximum weight stable set of a claw-free graph, Manuscript, 1999. Available at http://citeseer.nj.nec.com
14. T. Sandholm, Algorithm for Optimal Winner Determination in Combinatorial Auctions, Artificial Intelligence 135: 1-54, 2002.