Mathematical Foundations of Computer Science 2003
From MaRDI portal
Publication:5431303
DOI10.1007/b11836zbMath1124.68365OpenAlexW2495578842MaRDI QIDQ5431303
Marc Demange, Vangelis Th. Paschos, Cristina Bazgan, Giorgio Ausiello
Publication date: 7 December 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11836
Abstract computational complexity for mathematical programming problems (90C60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (6)
Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications ⋮ A better differential approximation ratio for symmetric TSP ⋮ Reductions, completeness and the hardness of approximability ⋮ New differential approximation algorithm for \(k\)-customer vehicle routing problem ⋮ Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness ⋮ Differential approximation schemes for half-product related functions and their scheduling applications
This page was built for publication: Mathematical Foundations of Computer Science 2003
