Approximate parametric searching

DOI10.1016/0020-0190(93)90149-4zbMath0776.68062OpenAlexW2067862282MaRDI QIDQ685496

Sivan Toledo

Publication date: 26 November 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90149-4

zbMATH Keywords

polynomial-time approximation algorithmNP completeparametric searchingmaximizing a class of concave functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (5)

On the complexity and approximability of budget-constrained minimum cost flows ⋮ An efficient, strongly polynomial, \(\varepsilon\)-approximation parametric optimization scheme ⋮ Optimal parametric search on graphs of bounded tree-width ⋮ \(\varepsilon\)-approximation minimization of convex functions in fixed dimension ⋮ A generalized approximation framework for fractional network flow and packing problems

Cites Work

• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Parallelism in Comparison Problems
• Slowing down sorting networks to obtain faster sorting algorithms

This page was built for publication: Approximate parametric searching