Skip to main content
SpringerLink
Log in

On local search for weighted κ-set packing

  • Conference paper
  • First Online:
Algorithms — ESA '97 (ESA 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1284))

Included in the following conference series:

Abstract

Given a collection of sets of cardinality at most k, with weights for each set, the maximum weighted packing problem is that of finding a collection of disjoint sets of maximum total weight. We study the worst case behavior of the t-local search heuristic for this problem proving a tight bound of k - 1+ 1/t. This continues the work of Hurkens and Schrijver for unweighted packing problems.

Partially supported by NSF Grant CCR-9504192

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Google Scholar 

  2. G. Cornuéjols and D. Hartvigsen, “An extension of matching theory”, Journal of Combinatorial Theory, Series B 40 1986, 285–296.

    Google Scholar 

  3. G. Cornuéjols, D. Hartvigsen and W. Pulleyblank, “Packing subgraphs in a graph”, Operations Research Letters 1 1982, 139–143.

    Google Scholar 

  4. P. Crescenzi and V. Kann, A compendium of NP optimization problems, http://www.nada.kth.se/nada/theory/problemlist.html.

    Google Scholar 

  5. T. Feo, O. Goldschmidt and M. Khellaf, “fOne-half approximation for the k-partition problem”, Operations Rsearch 40 1992, S170–S172.

    Google Scholar 

  6. D. A. Grable, “On random greedy triangle packing”, Technical Report, Institute of Computer Science, Humboldt University, Berlin, 1996.

    Google Scholar 

  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.

    Google Scholar 

  8. M. M. Halldórsson, “Approximating k-set cover and complementary graph coloring”, Proceedings of the 5th conference on Integer programming and Combinatorial Optimization (IPCO), 1996.

    Google Scholar 

  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.

    Google Scholar 

  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 (FOGS), 819–830, 1994.

    Google Scholar 

  11. Shlomi Rubinstein, private communication.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics and Statistics, State University of New York, 11794-3600, Stony Brook, NY, USA

    Esther M. Arkin

  2. Department of Statistics and Operations Research School of Mathematical Sciences, Tel-Aviv University, 69978, Tel-Aviv, Israel

    Refael Hassin

Authors
  1. Esther M. Arkin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Refael Hassin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rainer Burkard Gerhard Woeginger

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arkin, E.M., Hassin, R. (1997). On local search for weighted κ-set packing. In: Burkard, R., Woeginger, G. (eds) Algorithms — ESA '97. ESA 1997. Lecture Notes in Computer Science, vol 1284. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63397-9_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-63397-9_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63397-6

  • Online ISBN: 978-3-540-69536-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation