Structure preserving reductions among convex optimization problems

1980/08/01 by Giorgio Ausiello, G. Ausiello, Aurora D’Atri +3 · 6 citations
Computer Science · Engineering · Mathematics · #Combinatorial optimization #Combinatorics #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Conic optimization #Convex analysis #Convex optimization #Mathematical optimization #Mathematics #Optimization and Packing Problems #Optimization problem #Reduction (mathematics) #Regular polygon

paper · doi:10.1016/0022-0000(80)90046-x

crossref issued 1980/08/01 · crossref published 1980/08/01 · crossref published-print 1980/08/01 · openalex publication_date 1980/08/01 · crossref created 2003/12/04 · crossref deposited 2019/02/16 · openalex created_date 2025/10/10 · crossref indexed 2026/06/15 · openalex updated_date 2026/07/23

Citations

• The complexity of theorem-proving procedures
• Approximation algorithms for combinatorial problems
• Algorithms for Scheduling Independent Tasks
• Reducibility among Combinatorial Problems

Cited by

• Least and most colored bases
• On the complexity of approximating the independent set problem
• Proof verification and the hardness of approximation problems
• Proof verification and hardness of approximation problems
• On Approximate Solutions for Combinatorial Optimization Problems
• Feedback arc set [wikipedia]