A fast 3-approximation for the capacitated tree cover problem with edge loads
From MaRDI portal
Cites work
- A Best Possible Heuristic for the k-Center Problem
- A fast 3-approximation for the capacitated tree cover problem with edge loads
- A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering
- A local search approximation algorithm for \(k\)-means clustering
- An overview of graph covering and partitioning
- Approximation algorithms for a facility location problem with service capacities
- Approximation results for a min-max location-routing problem
- Approximations for minimum and min-max vehicle routing problems
- Better approximability results for min-max tree/cycle/path cover problems
- Combinatorial optimization in VLSI design
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
- Least squares quantization in PCM
- Min-max tree covers of graphs.
- The Capacitated K-Center Problem
This page was built for publication: A fast 3-approximation for the capacitated tree cover problem with edge loads
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891103)
