Pages that link to "Item:Q5470793"
From MaRDI portal
The following pages link to On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique (Q5470793):
Displaying 18 items.
- Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique (Q278736) (← links)
- Partial multicovering and the \(d\)-consecutive ones property (Q408373) (← links)
- Distributed approximation of cellular coverage (Q433421) (← links)
- Distributed algorithms for covering, packing and maximum weighted matching (Q661048) (← links)
- Local ratio with negative weights. (Q703278) (← links)
- Using fractional primal-dual to schedule split intervals with demands (Q865744) (← links)
- Data reductions and combinatorial bounds for improved approximation algorithms (Q899583) (← links)
- Elementary approximation algorithms for prize collecting Steiner tree problems (Q963393) (← links)
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749) (← links)
- Kernels for packing and covering problems (Q2272393) (← links)
- Admission control with advance reservations in simple networks (Q2466012) (← links)
- The set covering problem revisited: an empirical study of the value of dual information (Q2514674) (← links)
- Generalized Hypergraph Matching via Iterated Packing and Local Ratio (Q3453296) (← links)
- A Water-Filling Primal-Dual Algorithm for Approximating NonLinear Covering Problems (Q5058125) (← links)
- Distributed set cover approximation: Primal-dual with optimal locality (Q5090914) (← links)
- A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems (Q5346558) (← links)
- Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems (Q5505663) (← links)
- Automata, Languages and Programming (Q5716841) (← links)
