Pages that link to "Item:Q2757555"
From MaRDI portal
The following pages link to On local search for weighted \(k\)-set packing (Q2757555):
Displaying 34 items.
- A 0.5358-approximation for Bandpass-2 (Q498435) (← links)
- On the bandpass problem (Q543512) (← links)
- Uniform unweighted set cover: the power of non-oblivious local search (Q631761) (← links)
- On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
- On local search for weighted \(k\)-set packing (Q826067) (← links)
- Euclidean maximum matchings in the plane -- local to global (Q832859) (← links)
- Hardness of approximation for non-overlapping local alignments. (Q1427808) (← links)
- Improved approximation algorithms for weighted 2-path partitions (Q1706113) (← links)
- A local search algorithm for binary maximum 2-path partitioning (Q1799391) (← links)
- Local search for the minimum label spanning tree problem with bounded color classes. (Q1811627) (← links)
- The limits of local search for weighted \(k\)-set packing (Q2164726) (← links)
- Locality-preserving allocations problems and coloured bin packing (Q2355699) (← links)
- On spectrum sharing games (Q2377140) (← links)
- The path partition problem and related problems in bipartite graphs (Q2465958) (← links)
- Data dependent worst case bounds for weighted set packing (Q2484341) (← links)
- An approximation algorithm for maximum triangle packing (Q2492197) (← links)
- A modified greedy algorithm for dispersively weighted 3-set cover (Q2492216) (← links)
- Greedy local improvement and weighted set packing approximation (Q2729651) (← links)
- On the Size of Systems of Sets Every <i>t</i> of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems (Q3360178) (← links)
- Improved Approximation Algorithms for Weighted 2-Path Partitions (Q3452854) (← links)
- Generalized Hypergraph Matching via Iterated Packing and Local Ratio (Q3453296) (← links)
- Improved Parameterized Algorithms for Weighted 3-Set Packing (Q3511321) (← links)
- Angle Optimization in Target Tracking (Q3512448) (← links)
- Approximation algorithms for maximum weight <i>k</i>-coverings of graphs by packings (Q5063275) (← links)
- MAXIMUM WEIGHT CYCLE PACKING IN DIRECTED GRAPHS, WITH APPLICATION TO KIDNEY EXCHANGE PROGRAMS (Q5189989) (← links)
- A randomized approximation algorithm for metric triangle packing (Q5918266) (← links)
- Local search strikes again: PTAS for variants of geometric covering and packing (Q5920143) (← links)
- Approximating the directed path partition problem (Q6204168) (← links)
- Approximation algorithms for the maximum-weight cycle/path packing problems (Q6542868) (← links)
- Improved approximation algorithms for cycle and path packings (Q6575393) (← links)
- The limits of local search for weighted \(k\)-set packing (Q6589755) (← links)
- A deterministic approximation algorithm for metric triangle packing (Q6589849) (← links)
- An improved approximation algorithm for metric triangle packing (Q6636067) (← links)
- Euclidean maximum matchings in the plane -- local to global (Q6670815) (← links)
