Pages that link to "Item:Q3360178"

The following pages link to 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):

Displaying 30 items.

• Complexity results for rainbow matchings (Q2637345) (← links)
• Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location (Q2659777) (← links)
• Local improvement algorithms for a path packing problem: a performance analysis based on linear programming (Q2661591) (← links)
• Finding Large Independent Sets in Line of Sight Networks (Q2971663) (← links)
• The Complexity of Perfect Packings in Dense Graphs (Q2988829) (← links)
• Inapproximability of b-Matching in k-Uniform Hypergraphs (Q3078381) (← links)
• An Improved Approximation Bound for Spanning Star Forest and Color Saving (Q3182915) (← links)
• Improved Approximation Algorithms for Weighted 2-Path Partitions (Q3452854) (← links)
• Generalized Hypergraph Matching via Iterated Packing and Local Ratio (Q3453296) (← links)
• A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem (Q3599128) (← links)
• Improved Algorithms for Several Parameterized Problems Based on Random Methods (Q4632170) (← links)
• Approximating k-set cover and complementary graph coloring (Q4645918) (← links)
• Ignorance Is Almost Bliss: Near-Optimal Stochastic Matching with Few Queries (Q5130481) (← links)
• MAXIMUM WEIGHT CYCLE PACKING IN DIRECTED GRAPHS, WITH APPLICATION TO KIDNEY EXCHANGE PROGRAMS (Q5189989) (← links)
• Approximation algorithms and hardness results for the clique packing problem (Q5900079) (← links)
• Approximation algorithms and hardness results for the clique packing problem (Q5902134) (← links)
• A randomized approximation algorithm for metric triangle packing (Q5918266) (← links)
• On the Weisfeiler-Leman dimension of fractional packing (Q5918531) (← links)
• Approximate multi-matroid intersection via iterative refinement (Q5918919) (← links)
• Realization problems on reachability sequences (Q5925515) (← links)
• The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices (Q6144493) (← links)
• Approximating the directed path partition problem (Q6204168) (← links)
• Packing \(K_r\)s in bounded degree graphs (Q6497939) (← links)
• Kernelization for edge triangle packing and covering via a discharging method (Q6558639) (← links)
• On cluster editing problem with clusters of small sizes (Q6588757) (← links)
• The limits of local search for weighted \(k\)-set packing (Q6589755) (← links)
• A deterministic approximation algorithm for metric triangle packing (Q6589849) (← links)
• A discharging method: improved kernels for edge triangle packing and covering (Q6591629) (← links)
• An improved approximation algorithm for metric triangle packing (Q6636067) (← links)
• The maximum 3-star packing problem in claw-free cubic graphs (Q6645157) (← links)