Pages that link to "Item:Q3360178"
From MaRDI portal
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 50 items.
- An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs (Q306106) (← links)
- Matching and weighted \(P_2\)-packing: algorithms and kernels (Q393902) (← links)
- On the maximum disjoint paths problem on edge-colored graphs (Q435732) (← links)
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- Combinatorics for smaller kernels: the differential of a graph (Q476877) (← links)
- Bin packing with fragmentable items: presentation and approximations (Q497678) (← links)
- Greedy matching: guarantees and limitations (Q513303) (← links)
- Iterated local search with Trellis-neighborhood for the partial Latin square extension problem (Q525111) (← links)
- Shape rectangularization problems in intensity-modulated radiation therapy (Q534786) (← links)
- Uniform unweighted set cover: the power of non-oblivious local search (Q631761) (← links)
- Approximability of sparse integer programs (Q634673) (← links)
- When LP is the cure for your matching woes: improved bounds for stochastic matchings (Q692633) (← links)
- On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
- Looking at the stars (Q820158) (← links)
- Hardness and approximation of traffic grooming (Q837166) (← links)
- Analysis of approximation algorithms for \(k\)-set cover using factor-revealing linear programs (Q839632) (← links)
- Complexity issues in color-preserving graph embeddings (Q846361) (← links)
- Using fractional primal-dual to schedule split intervals with demands (Q865744) (← links)
- Two-dimensional packing with conflicts (Q929297) (← links)
- An improved kernelization for \(P_{2}\)-packing (Q991748) (← links)
- On approximating four covering and packing problems (Q1021577) (← links)
- Independent sets in bounded-degree hypergraphs (Q1026137) (← links)
- Weighted sum coloring in batch scheduling of conflicting jobs (Q1031871) (← links)
- Covering the edges of bipartite graphs using \(K_{2,2}\) graphs (Q1041216) (← links)
- A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing (Q1628680) (← 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)
- Scheduling time-constrained multicast messages in circuit-switched tree networks. (Q1853110) (← links)
- Packing triangles in bounded degree graphs. (Q1853132) (← links)
- A 6/5-approximation algorithm for the maximum 3-cover problem (Q1945696) (← links)
- On maximum \(P_3\)-packing in claw-free subcubic graphs (Q2025062) (← links)
- Distributed algorithms for matching in hypergraphs (Q2117684) (← links)
- Matching-based capture strategies for 3D heterogeneous multiplayer reach-avoid differential games (Q2125490) (← links)
- The limits of local search for weighted \(k\)-set packing (Q2164726) (← links)
- Stochastic packing integer programs with few queries (Q2191766) (← links)
- Counting frequent patterns in large labeled graphs: a hypergraph-based approach (Q2194034) (← links)
- Independent sets in Line of Sight networks (Q2201775) (← links)
- The complexity of perfect matchings and packings in dense hypergraphs (Q2284737) (← links)
- On spectrum sharing games (Q2377140) (← links)
- Minimization of SONET ADMs in ring networks revisited (Q2380804) (← links)
- Tight approximation bounds for combinatorial frugal coverage algorithms (Q2392738) (← links)
- Scheduling to minimize gaps and power consumption (Q2434309) (← links)
- Competitive router scheduling with structured data (Q2440162) (← links)
- Packing paths: recycling saves time (Q2446295) (← links)
- Algorithms for terminal Steiner trees (Q2465633) (← links)
- Packing triangles in low degree graphs and indifference graphs (Q2476287) (← links)
- An approximation algorithm for maximum triangle packing (Q2492197) (← links)
- A modified greedy algorithm for dispersively weighted 3-set cover (Q2492216) (← links)
- Dealing with several parameterized problems by random methods (Q2636503) (← links)
