Pages that link to "Item:Q2729651"
From MaRDI portal
The following pages link to Greedy Local Improvement and Weighted Set Packing Approximation (Q2729651):
Displaying 17 items.
- Solving the set packing problem via a maximum weighted independent set heuristic (Q826368) (← links)
- Parameterized algorithms for weighted matching and packing problems (Q955335) (← links)
- Matchings with lower quotas: algorithms and complexity (Q1702126) (← links)
- Distributed algorithms for matching in hypergraphs (Q2117684) (← links)
- The limits of local search for weighted \(k\)-set packing (Q2164726) (← links)
- The quality of equilibria for set packing and throughput scheduling games (Q2178650) (← links)
- Local search algorithms for the maximum carpool matching problem (Q2205630) (← links)
- Combinatorial auctions (Q2480257) (← links)
- An approximation algorithm for maximum triangle packing (Q2492197) (← links)
- A modified greedy algorithm for dispersively weighted 3-set cover (Q2492216) (← links)
- A dynamic programming algorithm for tree-like weighted set packing problem (Q2638196) (← links)
- How heavy independent sets help to find arborescences with many leaves in DAGs (Q2698292) (← links)
- Improved Parameterized Algorithms for Weighted 3-Set Packing (Q3511321) (← links)
- Technical Note—Online Hypergraph Matching with Delays (Q5106363) (← links)
- (Q5111744) (← links)
- Robust Independence Systems (Q5892606) (← links)
- On conceptually simple algorithms for variants of online bipartite matching (Q5915658) (← links)
