scientific article; zbMATH DE number 1256706
From MaRDI portal
Publication:4228442
zbMath0917.52005MaRDI QIDQ4228442
Publication date: 2 August 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
convex setpolynomial algorithmspolynomial approximation algorithms\(NP\)-hard problemsEuclidean Traveling Salesman Problemparametric max flow problemparametric minimum \(s-t\) distanceparametric spanning tree problempiecewise polynomial concave function
Analysis of algorithms and problem complexity (68Q25) Convex functions and convex programs in convex geometry (52A41) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items (3)
On the complexity and approximability of budget-constrained minimum cost flows ⋮ On the planar piecewise quadratic 1-center problem ⋮ A generalized approximation framework for fractional network flow and packing problems
This page was built for publication:
