Pages that link to "Item:Q5313048"

The following pages link to Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313048):

Displaying 30 items.

• Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems (Q517802) (← links)
• Video distribution under multiple constraints (Q551203) (← links)
• How to allocate review tasks for robust ranking (Q707596) (← links)
• Minimizing latency of capacitated \(k\)-tours (Q724250) (← links)
• Maximum coverage problem with group budget constraints (Q1680483) (← links)
• Spider covers and their applications (Q1935978) (← links)
• Generalized budgeted submodular set function maximization (Q2051778) (← links)
• Locally defined independence systems on graphs (Q2109105) (← links)
• Maximum coverage with cluster constraints: an LP-based approximation technique (Q2117688) (← links)
• Siting renewable power generation assets with combinatorial optimisation (Q2119746) (← links)
• Faster algorithms for orienteering and \(k\)-TSP (Q2124233) (← links)
• Minimum hitting set of interval bundles problem: computational complexity and approximability (Q2161003) (← links)
• Mobile facility location: combinatorial filtering via weighted occupancy (Q2251136) (← links)
• An approximation algorithm for vehicle routing with compatibility constraints (Q2294242) (← links)
• Efficient approximation algorithms for maximum coverage with group budget constraints (Q2317355) (← links)
• Better streaming algorithms for the maximum coverage problem (Q2322721) (← links)
• Approximability of the firefighter problem. Computing cuts over time (Q2428668) (← links)
• Approximation algorithms for the traveling repairman and speeding deliveryman problems (Q2428683) (← links)
• Approximating the \(k\)-traveling repairman problem with repair times (Q2457300) (← links)
• The multi-budget maximum weighted coverage problem (Q2692723) (← links)
• Capacitated Vehicle Routing with Nonuniform Speeds (Q2800377) (← links)
• Capacitated Vehicle Routing with Non-uniform Speeds (Q3009766) (← links)
• Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems (Q3088103) (← links)
• (Q5005131) (← links)
• Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems (Q5085153) (← links)
• Precedence-Constrained Min Sum Set Cover (Q5136276) (← links)
• Running Errands in Time: Approximation Algorithms for Stochastic Orienteering (Q5245015) (← links)
• (Q5743496) (← links)
• Deadline TSP (Q5925174) (← links)
• Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph (Q5963643) (← links)