Maximizing concave functions in fixed dimension
From MaRDI portal
Cited in
(16)- A generalized approximation framework for fractional network flow and packing problems
- Faster algorithms for next breakpoint and max value for parametric global minimum cuts
- Decomposable multi-parameter matroid optimization problems.
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
- An efficient, strongly polynomial, -approximation parametric optimization scheme
- \(\varepsilon\)-approximation minimization of convex functions in fixed dimension
- Algorithmic results for ordered median problems
- Optimal parametric search on graphs of bounded tree-width
- An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions
- A survey of exact and approximation algorithms for linear-parametric optimization problems
- Revisiting k-sum optimization
- Minimizing the sum of the \(k\) largest functions in linear time.
- Using sparsification for parametric minimum spanning tree problems
- An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem
- Weighted search in the plane
This page was built for publication: Maximizing concave functions in fixed dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2743984)
