Approximate parametric searching

DOI10.1016/0020-0190(93)90149-4MaRDI QIDQ685496zbMATH OpenOpenAlexFDO

Authors 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

maximizing a class of concave functionsNP completeparametric searchingpolynomial-time approximation algorithm

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1256706
• The complexity of approximating a nonlinear program
• scientific article; zbMATH DE number 1182930
• On nonlinear parametric search
• An approximation algorithm for a general class of parametric optimization 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

Cited in

(10)

• Weakly adaptive comparison searching
• \(\varepsilon\)-approximation minimization of convex functions in fixed dimension
• On the complexity and approximability of budget-constrained minimum cost flows
• An efficient, strongly polynomial, -approximation parametric optimization scheme
• Optimization of partial search
• scientific article; zbMATH DE number 1256706 (Why is no real title available?)
• scientific article; zbMATH DE number 1182930 (Why is no real title available?)
• Optimal parametric search on graphs of bounded tree-width
• A generalized approximation framework for fractional network flow and packing problems
• A survey of exact and approximation algorithms for linear-parametric optimization problems

This page was built for publication: Approximate parametric searching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685496)