Algorithms - ESA 2003

DOI10.1007/b13632zbMath1266.90200OpenAlexW1827234103WikidataQ60299159 ScholiaQ60299159MaRDI QIDQ5897267

Shmuel Safra, Oded Schwartz

Publication date: 3 March 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b13632

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

On the minimum corridor connection problem and other generalized geometric problems, Largest and smallest convex hulls for imprecise points, Approximation Algorithms for Generalized MST and TSP in Grid Clusters, Complexity of the minimum-length corridor problem, A decomposition approach for optimal control problems with integer innerpoint state constraints