Pages that link to "Item:Q2506163"
From MaRDI portal
The following pages link to On the complexity of approximating \(k\)-set packing (Q2506163):
Displaying 45 items.
- Shrinking maxima, decreasing costs: new online packing and covering problems (Q289907) (← links)
- Competitive buffer management with packet dependencies (Q388119) (← links)
- Bin packing with fragmentable items: presentation and approximations (Q497678) (← links)
- Greedy matching: guarantees and limitations (Q513303) (← links)
- Combinatorial auctions without money (Q521808) (← links)
- Inapproximability of maximal strip recovery (Q551208) (← 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)
- Analysis of approximation algorithms for \(k\)-set cover using factor-revealing linear programs (Q839632) (← links)
- Coupled and \(k\)-sided placements: generalizing generalized assignment (Q896299) (← links)
- On approximating four covering and packing problems (Q1021577) (← links)
- Maximum coverage problem with group budget constraints (Q1680483) (← links)
- Distributed approximation of \(k\)-service assignment (Q1733389) (← links)
- Distributed backup placement in networks (Q1741963) (← links)
- Flexible allocation on related machines with assignment restrictions (Q1801074) (← links)
- Exponential inapproximability of selecting a maximum volume sub-matrix (Q1939669) (← links)
- \(k\)-optimal: a novel approximate inference algorithm for ProbLog (Q1945136) (← links)
- A 6/5-approximation algorithm for the maximum 3-cover problem (Q1945696) (← links)
- Distributed algorithms for matching in hypergraphs (Q2117684) (← links)
- Hypergraph representation via axis-aligned point-subspace cover (Q2154113) (← 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)
- Scheduling split intervals with non-uniform demands (Q2218651) (← links)
- Constrained submodular maximization via greedy local search (Q2294252) (← links)
- A computational approach to unbiased districting (Q2389779) (← links)
- Combinatorial auctions with verification are tractable (Q2512655) (← links)
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
- An Approximation Result for Matchings in Partitioned Hypergraphs (Q2806888) (← links)
- A Lower Bound of the cd-Chromatic Number and Its Complexity (Q2971664) (← links)
- Iterative Packing for Demand and Hypergraph Matching (Q3009775) (← links)
- Inapproximability of b-Matching in k-Uniform Hypergraphs (Q3078381) (← links)
- Submodular Stochastic Probing on Matroids (Q3186541) (← links)
- Generalized Hypergraph Matching via Iterated Packing and Local Ratio (Q3453296) (← links)
- Online Admission Control and Embedding of Service Chains (Q3460710) (← links)
- A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem (Q3599128) (← links)
- (Q5009516) (← links)
- Technical Note—Online Hypergraph Matching with Delays (Q5106363) (← links)
- Submodular Maximization Through the Lens of Linear Programming (Q5108239) (← links)
- Online Submodular Maximization Problem with Vector Packing Constraint. (Q5111710) (← links)
- Inapproximability of $H$-Transversal/Packing (Q5348212) (← links)
- Overflow management with self-eliminations (Q5918714) (← links)
- \(\ell_1\)-sparsity approximation bounds for packing integer programs (Q5918913) (← links)
- Overflow management with self-eliminations (Q5925615) (← links)
- On the parameterized complexity of compact set packing (Q6091178) (← links)