scientific article; zbMATH DE number 1445293
From MaRDI portal
Publication:4952606
Recommendations
Cited in
(86)- Approximating covering integer programs with multiplicity constraints
- Theoretical challenges towards cutting-plane selection
- An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem
- Greedy algorithms for the single-demand facility location problem
- How unsplittable-flow-covering helps scheduling with job-dependent cost functions
- Aggregation-based cutting-planes for packing and covering integer programs
- Greedy -approximation algorithm for covering with arbitrary constraints and submodular cost
- Easy capacitated facility location problems, with connections to lot-sizing
- Pitch, extension complexity, and covering problems
- Precedence-constrained covering problems with multiplicity constraints
- A technique for obtaining true approximations for \(k\)-center with covering constraints
- Algorithms for covering multiple submodular constraints and applications
- An approximation algorithm for the partial covering 0-1 integer program
- Approximability of capacitated network design
- Primal-dual algorithms for precedence constrained covering problems
- Fixed-charge transportation on a path: optimization, LP formulations and separation
- Approximating the two-level facility location problem via a quasi-greedy approach
- Approximation algorithms for covering/packing integer programs
- An improved approximation algorithm for vertex cover with hard capacities
- On fixed cost k-flow problems
- Lifting the knapsack cover inequalities for the knapsack polytope
- On inequalities with bounded coefficients and pitch for the min knapsack polytope
- Fixed-parameter algorithms for unsplittable flow cover
- Maximizing coverage while ensuring fairness: a tale of conflicting objectives
- Throughput maximization in multiprocessor speed-scaling
- Throughput Maximization in Multiprocessor Speed-Scaling
- LP-based algorithms for capacitated facility location
- Approximability of capacitated network design
- Fixed-charge transportation on a path: linear programming formulations
- Integrality gaps for strengthened linear relaxations of capacitated facility location
- On capacitated set cover problems
- A primal-dual approximation algorithm for min-sum single-machine scheduling problems
- Fair scheduling via iterative quasi-uniform sampling
- Constant approximation algorithm for nonuniform capacitated multi-item lot sizing via strong covering inequalities
- Weighted reordering buffer improved via variants of knapsack covering inequalities
- Approximate Deadline-Scheduling with Precedence Constraints
- A Lasserre lower bound for the min-sum single machine scheduling problem
- Primal-dual algorithms for precedence constrained covering problems
- Minimum-cost network design with (dis)economies of scale
- Primal-Dual Schema for Capacitated Covering Problems
- On column-restricted and priority covering integer programs
- Tightening simple mixed-integer sets with guaranteed bounds
- Resource allocation problem under single resource assignment
- Small extended formulation for knapsack cover inequalities from monotone circuits
- Improved algorithm for resource allocation problems
- Small extended formulation for knapsack cover inequalities from monotone circuits
- Recent developments in approximation algorithms for facility location and clustering problems
- The minimum vulnerability problem
- On set expansion problems and the small set expansion conjecture
- Fractional routing using pairs of failure-disjoint paths
- Generalized center problems with outliers
- Generalized center problems with outliers
- A technique for obtaining true approximations for k-center with covering constraints
- A water-filling primal-dual algorithm for approximating nonlinear covering problems
- Fast and deterministic approximations for \(k\)-cut
- Scheduling to approximate minimization objectives on identical machines
- Approximating sparse covering integer programs online
- Facility Location with Matroid or Knapsack Constraints
- A primal-dual approximation algorithm for Min-sum single-machine scheduling problems
- Fast and Deterministic Approximations for k-Cut.
- Robust \(k\)-center with two types of radii
- Robust \(k\)-center with two types of radii
- Precedence-constrained covering problems with multiplicity constraints
- On the geometric priority set cover problem
- On improved interval cover mechanisms for crowdsourcing markets
- Auditing for core stability in participatory budgeting
- Approximability of sparse integer programs
- Cluster before you hallucinate: node-capacitated network design and energy efficient routing
- Approximating integer programs with positive right-hand sides
- Online multiset submodular cover
- Distributed algorithms for covering, packing and maximum weighted matching
- LP-based approximation algorithms for capacitated facility location
- A constant-factor approximation for weighted bond cover
- A water-filling primal-dual algorithm for approximating nonlinear covering problems
- On generalizations of partial scenario set cover
- A global analysis of the primal-dual method for edge augmentation problems
- Budget-feasible mechanism design: simpler, better mechanisms and general payment constraints
- Approximation algorithm for prize-collecting weighted set cover with fairness constraints
- Bounding the price-of-fair-sharing using knapsack-cover constraints to guide near-optimal cost-recovery algorithms
- Approximation algorithms for the partition set cover problem with penalties
- A note on submodular function minimization with covering type linear constraints
- Minimum-cost mixed graph covers with targeted weight constraints
- Improved approximation algorithms for capacitated network design and flexible graph connectivity
- Approximation algorithms for the partition vertex cover problem
- Primal-dual schema for capacitated covering problems
- Faster and simpler approximation algorithms for mixed packing and covering problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4952606)
