scientific article; zbMATH DE number 1445293
From MaRDI portal
Publication:4952606
zbMath0970.90069MaRDI QIDQ4952606
Lisa K. Fleischer, Robert D. Carr, Vitus J. Leung, Cynthia A. Phillips
Publication date: 23 October 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (73)
Throughput maximization in multiprocessor speed-scaling ⋮ A Technique for Obtaining True Approximations for k-Center with Covering Constraints ⋮ Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities ⋮ Integrality gaps for strengthened linear relaxations of capacitated facility location ⋮ 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 ⋮ A Water-Filling Primal-Dual Algorithm for Approximating NonLinear Covering Problems ⋮ Resource allocation problem under single resource assignment ⋮ Minimum-Cost Network Design with (Dis)economies of Scale ⋮ Theoretical challenges towards cutting-plane selection ⋮ Algorithms for covering multiple submodular constraints and applications ⋮ Lifting the knapsack cover inequalities for the knapsack polytope ⋮ Partial Resampling to Approximate Covering Integer Programs ⋮ Primal-dual algorithms for precedence constrained covering problems ⋮ Throughput Maximization in Multiprocessor Speed-Scaling ⋮ Faster and simpler approximation algorithms for mixed packing and covering problems ⋮ On inequalities with bounded coefficients and pitch for the min knapsack polytope ⋮ An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem ⋮ Primal-Dual Schema for Capacitated Covering Problems ⋮ Sum-of-squares hierarchy lower bounds for symmetric formulations ⋮ On the geometric priority set cover problem ⋮ On improved interval cover mechanisms for crowdsourcing markets ⋮ Unnamed Item ⋮ Auditing for core stability in participatory budgeting ⋮ Approximating covering integer programs with multiplicity constraints ⋮ Tightening simple mixed-integer sets with guaranteed bounds ⋮ Improved Algorithm for Resource Allocation Problems ⋮ Approximability of sparse integer programs ⋮ LP-Based Algorithms for Capacitated Facility Location ⋮ Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost ⋮ Fixed-charge transportation on a path: optimization, LP formulations and separation ⋮ Fixed-parameter algorithms for unsplittable flow cover ⋮ Maximizing coverage while ensuring fairness: a tale of conflicting objectives ⋮ Approximating integer programs with positive right-hand sides ⋮ Greedy algorithms for the single-demand facility location problem ⋮ Distributed algorithms for covering, packing and maximum weighted matching ⋮ LP-based approximation algorithms for capacitated facility location ⋮ The minimum vulnerability problem ⋮ Fast and Deterministic Approximations for k-Cut. ⋮ On set expansion problems and the small set expansion conjecture ⋮ Fair Scheduling via Iterative Quasi-Uniform Sampling ⋮ Fractional routing using pairs of failure-disjoint paths ⋮ Easy capacitated facility location problems, with connections to lot-sizing ⋮ Approximability of Capacitated Network Design ⋮ Fixed-Charge Transportation on a Path: Linear Programming Formulations ⋮ How unsplittable-flow-covering helps scheduling with job-dependent cost functions ⋮ Unnamed Item ⋮ Precedence-constrained covering problems with multiplicity constraints ⋮ Approximating Sparse Covering Integer Programs Online ⋮ Approximating the two-level facility location problem via a quasi-greedy approach ⋮ Unnamed Item ⋮ Aggregation-based cutting-planes for packing and covering integer programs ⋮ A note on submodular function minimization with covering type linear constraints ⋮ Recent Developments in Approximation Algorithms for Facility Location and Clustering Problems ⋮ Robust \(k\)-center with two types of radii ⋮ An approximation algorithm for the partial covering 0-1 integer program ⋮ Robust \(k\)-center with two types of radii ⋮ Approximation algorithms for the partition vertex cover problem ⋮ Primal-dual schema for capacitated covering problems ⋮ Generalized Center Problems with Outliers ⋮ On Capacitated Set Cover Problems ⋮ A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems ⋮ Constant Approximation Algorithm for Nonuniform Capacitated Multi-Item Lot Sizing via Strong Covering Inequalities ⋮ Pitch, extension complexity, and covering problems ⋮ Precedence-constrained covering problems with multiplicity constraints ⋮ Facility Location with Matroid or Knapsack Constraints ⋮ Approximation algorithms for covering/packing integer programs ⋮ An improved approximation algorithm for vertex cover with hard capacities ⋮ Approximability of capacitated network design ⋮ A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems ⋮ On fixed cost \(k\)-flow problems ⋮ A technique for obtaining true approximations for \(k\)-center with covering constraints
This page was built for publication:
