scientific article
From MaRDI portal
Publication:2743984
zbMath0968.90504MaRDI QIDQ2743984
Publication date: 18 September 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60)
Related Items (15)
Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts ⋮ An efficient, strongly polynomial, \(\varepsilon\)-approximation parametric optimization scheme ⋮ Using sparsification for parametric minimum spanning tree problems ⋮ Optimal parametric search on graphs of bounded tree-width ⋮ \(\varepsilon\)-approximation minimization of convex functions in fixed dimension ⋮ Revisiting \(k\)-sum optimization ⋮ Linear-time algorithms for parametric minimum spanning tree problems on planar graphs ⋮ Decomposable multi-parameter matroid optimization problems. ⋮ An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions ⋮ Weighted search in the plane ⋮ An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem ⋮ A generalized approximation framework for fractional network flow and packing problems ⋮ Linear-time algorithms for parametric minimum spanning tree problems on planar graphs ⋮ Minimizing the sum of the \(k\) largest functions in linear time. ⋮ Algorithmic results for ordered median problems
This page was built for publication:
