Pages that link to "Item:Q1849526"
From MaRDI portal
The following pages link to The primal-dual method for approximation algorithms (Q1849526):
Displaying 15 items.
- Combination of parallel machine scheduling and vertex cover (Q690471) (← links)
- The primal-dual algorithm as a constraint-set-manipulation device (Q811396) (← links)
- An approximation algorithm for submodular hitting set problem with linear penalties (Q830939) (← links)
- Using fractional primal-dual to schedule split intervals with demands (Q865744) (← links)
- A primal-dual approximation algorithm for the survivable network design problem in hypergraphs (Q1861578) (← links)
- Improved solution to data gathering with mobile mule (Q2205629) (← links)
- The \(k\)-separator problem: polyhedra, complexity and approximation results (Q2354313) (← links)
- Worst-case performance of Wong's Steiner tree heuristic (Q2489899) (← links)
- The set covering problem revisited: an empirical study of the value of dual information (Q2514674) (← links)
- On a primal-proximal heuristic in discrete optimization (Q2571002) (← links)
- A greedy approximation algorithm for the uniform metric labeling problem analyzed by a primal-dual technique (Q3507758) (← links)
- Improved Approximation Algorithm for the Combination of Parallel Machine Scheduling and Vertex Cover (Q4639895) (← links)
- Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants (Q4891748) (← links)
- On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique (Q5470793) (← links)
- Approximation and Online Algorithms (Q5896928) (← links)
