On local search for weighted k-set packing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1284, Issue , 1997, Pages 13-22

  Arkin, Esther M ^a   Hassin, Refael ^b  

^a Stony Brook University   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC ALGORITHMS;

CARDINALITIES; DISJOINT SETS; LOCAL SEARCH; LOCAL SEARCH HEURISTICS; PACKING PROBLEMS; SET PACKING; TIGHT BOUND; WORST-CASE BEHAVIORS;

LOCAL SEARCH (OPTIMIZATION);

EID: 84949202284     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63397-9_2     Document Type: Conference Paper

References (11)

1. V. Bafna, B. Narayanan, and R. Ravi, "Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles)", Proceedings of the Workshop for Algorithms and Data Structures (WADS), 1995.
2. G. Comuéjols and D. Hartvigsen, "An extension of matching theory", Journal of Combinatorial Theory, Series B 40 1986, 285-296.
3. G. Comuéjols, D. Hartvigsen and W. Puileyblank, "Packing subgraphs in a graph", Operations Research Letters 1 1982, 139-143.
4. P. Crescenzi and V. Kann, A compendium of NP optimization problems, http://www.nada.kth.se/nada/theory/problemlist.html.
5. T. Feo, O. Goldschmidt and M. Khellaf, "One-half approximation for the fc-partition problem", Operations Rsearch 40 1992, S170-S172.
6. D. A. Grable, "On random greedy triangle packing", Technical Report, Institute of Computer Science, Humboldt University, Berlin, 1996.
7. M. M. Halldórsson, "Approximating discrete collections via local improvements", Proceedings of the 6th annual ACM-SIAM symposium on discrete algorithms (SODA) 160-169, 1995.
8. M. M. Halldórsson, "Approximating fe-set cover and complementary graph coloring", Proceedings of the 5th conference on Integer programming and Combinatorial Optimization (IPCO), 1996.
9. C. A. J. Hurkens and A. Schrijver. "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", SIAM J. on Discrete Mathematics 2, 68-72, 1989.
10. S. Khanna, R. Motwani, M. Sudan, and U. Vazirani, "On syntactic versus Computational views of approximability", Proceedings of the 35th annual IEEE symposium on Foundations of Computer Science (FOCS), 819-830, 1994.
11. Shlomi Rubinstein, private communication.