Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

DOI10.1007/b99805zbMath1106.90062OpenAlexW4301133941MaRDI QIDQ5313048

Publication date: 25 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99805

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (34)

Siting renewable power generation assets with combinatorial optimisation ⋮ Faster algorithms for orienteering and \(k\)-TSP ⋮ Minimum hitting set of interval bundles problem: computational complexity and approximability ⋮ Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems ⋮ Maximum coverage problem with group budget constraints ⋮ Spider covers and their applications ⋮ Improved and generalized algorithms for burning a planar point set ⋮ Groups burning: analyzing spreading processes in community-based networks ⋮ Resource time-sharing for IoT applications with deadlines ⋮ Energy-constrained geometric coverage problem ⋮ Approximability of the firefighter problem. Computing cuts over time ⋮ Approximation algorithms for the traveling repairman and speeding deliveryman problems ⋮ Unnamed Item ⋮ The multi-budget maximum weighted coverage problem ⋮ Approximating the \(k\)-traveling repairman problem with repair times ⋮ Capacitated Vehicle Routing with Non-uniform Speeds ⋮ Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems ⋮ Mobile facility location: combinatorial filtering via weighted occupancy ⋮ Video distribution under multiple constraints ⋮ How to allocate review tasks for robust ranking ⋮ Minimizing latency of capacitated \(k\)-tours ⋮ Deadline TSP ⋮ Capacitated Vehicle Routing with Nonuniform Speeds ⋮ Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph ⋮ An approximation algorithm for vehicle routing with compatibility constraints ⋮ Generalized budgeted submodular set function maximization ⋮ Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems ⋮ Efficient approximation algorithms for maximum coverage with group budget constraints ⋮ Better streaming algorithms for the maximum coverage problem ⋮ Running Errands in Time: Approximation Algorithms for Stochastic Orienteering ⋮ Unnamed Item ⋮ Precedence-Constrained Min Sum Set Cover ⋮ Locally defined independence systems on graphs ⋮ Maximum coverage with cluster constraints: an LP-based approximation technique

This page was built for publication: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques