On local search for weighted k-set packing

Mathematics of Operations Research

Volumn 23, Issue 3, 1998, Pages 640-648

  Arkin, Esther M ^a   Hassin, Refael ^b  

^a Stony Brook University   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Local search; Performance guarantee; Set packing

Indexed keywords

ALGORITHMS; CALCULATIONS; HEURISTIC METHODS; INTEGER PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

LOCAL SEARCH; SET PACKING;

OPERATIONS RESEARCH;

EID: 0032131307     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.23.3.640     Document Type: Article

References (11)

1. Bafna, V., B. Narayanan, R. Ravi. 1995. Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles). Proceedings of the Workshop for Algorithms and Data Structures (WADS), Springer Verlag, LNCS 955, New York.
2. Cornuéjols, G., D. Hartvigsen. 1986. An extension of matching theory. J. Combin. Theory Ser. B 40 285-296.
3. _, _, W Pulleyblank. 1982. Packing subgraphs in a graph. Oper. Res. Lett 1 139-143.
4. Crescenzi, P., V. Kann. 1997. A compendium of NP optimization problems. http://www.nada.kth.se/nada/theory/ problemlist.html.
5. Duh, R , M. Fürer. 1997. Approximation of k-set cover by semi-local optimization. Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC), 256-264
6. Feo, T., O Goldschmidt, M. Khellaf. 1992. One-half approximation for the k-partition problem, Oper. Res. 40, S170-S172.
7. Grable, D. A 1997 On random greedy triangle packing. Electronic J. Combin. 4 R11, 19.
8. Halldórsson, M. M. (1995). Approximating discrete collections via local improvements. Proceedings of the 6th annual ACM-SIAM symposium on discrete algorithms (SODA), 160-169.
9. _ (1996). Approximating k-set cover and complementary graph coloring. Proceedings of the 5th Conference on Integer Programming and Combinatorial Optimization (IPCO).
10. Hurkens, C. A. J., A. Schrijver. 1989. 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. Discrete Math 2 68-72.
11. Khanna, S., R. Motwani, M. Sudan, U. Vazirani. 1994. On syntactic versus computational views of approximability. Proceedings the 35th annual IEEE symposium on Foundations of Computer Science (FOCS), 819-830.