Pages that link to "Item:Q293139"
From MaRDI portal
The following pages link to Improved performance of the greedy algorithm for partial cover (Q293139):
Displaying 33 items.
- Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
- Partial multicovering and the \(d\)-consecutive ones property (Q408373) (← links)
- Complexity of majority monopoly and signed domination problems (Q414422) (← links)
- Graph coloring with rejection (Q632809) (← links)
- Approximation algorithms for the partition vertex cover problem (Q744047) (← links)
- Partial multicuts in trees (Q861281) (← links)
- An approximation algorithm to the \(k\)-Steiner forest problem (Q1007251) (← links)
- Computing small partial coverings (Q1007552) (← links)
- A simple approximation algorithm for minimum weight partial connected set cover (Q1680500) (← links)
- On approximation of the submodular set cover problem (Q1969763) (← links)
- Approximation algorithm for the partial set multi-cover problem (Q2010112) (← links)
- Approximation algorithm for stochastic set cover problem (Q2039642) (← links)
- A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem (Q2080830) (← links)
- A primal-dual algorithm for the minimum power partial cover problem (Q2082206) (← links)
- Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty (Q2084632) (← links)
- Improved budgeted connected domination and budgeted edge-vertex domination (Q2222087) (← links)
- Parallel approximation for partial set cover (Q2243336) (← links)
- A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem (Q2282997) (← links)
- A primal-dual algorithm for the minimum partial set multi-cover problem (Q2307495) (← links)
- Capacitated Arc Stabbing (Q2376793) (← links)
- Local ratio method on partial set multi-cover (Q2410050) (← links)
- On fair covering and hitting problems (Q2672421) (← links)
- Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph (Q2674709) (← links)
- Approximation algorithm for partial set multicover versus full set multicover (Q4634530) (← links)
- Breaking the<i>r</i><sub>max</sub>Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem (Q4995101) (← links)
- Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination (Q5041206) (← links)
- Constant Approximation for the Lifetime Scheduling Problem of <i>p</i>-Percent Coverage (Q5058008) (← links)
- On Partial Covering For Geometric Set Systems (Q5115815) (← links)
- Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems (Q5210996) (← links)
- Approximating Partially Bounded Degree Deletion on Directed Graphs (Q5240368) (← links)
- Combinatorial optimization algorithms for radio network planning (Q5941516) (← links)
- Approximation algorithms for minimum weight partial connected set cover problem (Q5963645) (← links)
- On colorful vertex and edge cover problems (Q6088300) (← links)
