The primal-dual method for approximation algorithms
From MaRDI portal
Recommendations
- Primal and dual approximation algorithms for convex vector optimization problems
- Primal-dual methods for linear programming
- A primal-dual simplex method for linear programs
- Primal-dual algorithms for the assignment problem
- A primal dual integer programming algorithm
- scientific article; zbMATH DE number 1086510
- A new efficient primal dual simplex algorithm
- Primal and dual algorithms for optimization over the efficient set
- A primal-dual approximation algorithm for \textsc{minsat}
Cited in
(16)- An approximation algorithm for submodular hitting set problem with linear penalties
- Using fractional primal-dual to schedule split intervals with demands
- Combination of parallel machine scheduling and vertex cover
- On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique
- The primal-dual algorithm as a constraint-set-manipulation device
- A greedy approximation algorithm for the uniform metric labeling problem analyzed by a primal-dual technique
- A primal-dual approximation algorithm for the survivable network design problem in hypergraphs
- Improved approximation algorithm for the combination of parallel machine scheduling and vertex cover
- Worst-case performance of Wong's Steiner tree heuristic
- Approximation and Online Algorithms
- On a primal-proximal heuristic in discrete optimization
- scientific article; zbMATH DE number 2086430 (Why is no real title available?)
- Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants
- The k-separator problem: polyhedra, complexity and approximation results
- Improved solution to data gathering with mobile mule
- The set covering problem revisited: an empirical study of the value of dual information
This page was built for publication: The primal-dual method for approximation algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1849526)
