A water-filling primal-dual algorithm for approximating nonlinear covering problems
From MaRDI portal
Cites work
- A Greedy Heuristic for the Set-Covering Problem
- A linear-time approximation algorithm for the weighted vertex cover problem
- A primal-dual approximation algorithm for Min-sum single-machine scheduling problems
- A unified approach to approximating resource allocation and scheduling
- An improved approximation ratio for the minimum latency problem
- Approximation algorithms for the capacitated multi-item lot-sizing problem via flow-cover inequalities
- Constant approximation algorithm for non-uniform capacitated multi-item lot-sizing via strong covering inequalities
- How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions
- scientific article; zbMATH DE number 1445293 (Why is no real title available?)
- LP-based algorithms for capacitated facility location
- On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique
- Primal-dual algorithms for precedence constrained covering problems
- Primal-dual schema for capacitated covering problems
- Scheduling to approximate minimization objectives on identical machines
- Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
- Small extended formulation for knapsack cover inequalities from monotone circuits
- The design of approximation algorithms
- The geometry of scheduling
This page was built for publication: A water-filling primal-dual algorithm for approximating nonlinear covering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842529)
