Pages that link to "Item:Q2575835"
From MaRDI portal
The following pages link to Approximation algorithms for covering/packing integer programs (Q2575835):
Displayed 26 items.
- Approximation algorithm for partial positive influence problem in social network (Q511731) (← links)
- Approximability of sparse integer programs (Q634673) (← links)
- Distributed algorithms for covering, packing and maximum weighted matching (Q661048) (← links)
- Dynamic programming based algorithms for set multicover and multiset multicover problems (Q974740) (← links)
- Lower bounds and algorithms for the minimum cardinality bin covering problem (Q1752204) (← links)
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749) (← links)
- Precedence-constrained covering problems with multiplicity constraints (Q2085754) (← links)
- Algorithms for covering multiple submodular constraints and applications (Q2165261) (← links)
- Stochastic packing integer programs with few queries (Q2191766) (← links)
- Mobile facility location: combinatorial filtering via weighted occupancy (Q2251136) (← links)
- A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem (Q2282997) (← links)
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
- Computing a small agreeable set of indivisible items (Q2321268) (← links)
- Local ratio method on partial set multi-cover (Q2410050) (← links)
- Few cuts meet many point sets (Q2696278) (← links)
- Approximate Deadline-Scheduling with Precedence Constraints (Q3452812) (← links)
- Partial Resampling to Approximate Covering Integer Programs (Q4575724) (← links)
- (Q5077149) (← links)
- Approximating Sparse Covering Integer Programs Online (Q5247608) (← links)
- (Q5743501) (← links)
- Fast and Deterministic Approximations for k-Cut. (Q5875475) (← links)
- Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations (Q5970783) (← links)
- Precedence-constrained covering problems with multiplicity constraints (Q6039535) (← links)
- Set selection under explorable stochastic uncertainty via covering techniques (Q6086011) (← links)
- On improved interval cover mechanisms for crowdsourcing markets (Q6164503) (← links)
- Auditing for core stability in participatory budgeting (Q6167256) (← links)