The limits of local search for weighted \(k\)-set packing
From MaRDI portal
Publication:2164726
DOI10.1007/978-3-031-06901-7_31zbMath1497.90178OpenAlexW4285281596MaRDI QIDQ2164726
Publication date: 16 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-06901-7_31
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On maximal independent sets of vertices in claw-free graphs
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- On the complexity of approximating \(k\)-set packing
- Greedy Local Improvement and Weighted Set Packing Approximation
- On Local Search for Weighted k-Set Packing
- Approximating the $$k$$-Set Packing Problem by Local Improvements
- 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
- A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
- Reducibility among Combinatorial Problems
- Large Neighborhood Local Search for the Maximum Set Packing Problem
- Maximum matching and a polyhedron with 0,1-vertices
- How to Sell Hyperedges: The Hypermatching Assignment Problem
This page was built for publication: The limits of local search for weighted \(k\)-set packing