Algorithms - ESA 2003
From MaRDI portal
Publication:5897255
DOI10.1007/b13632zbMath1266.68229OpenAlexW1827234103WikidataQ60299159 ScholiaQ60299159MaRDI QIDQ5897255
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
Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (4)
Adding cardinality constraints to integer programs with applications to maximum satisfiability ⋮ A new upper bound for Max-2-SAT: A graph-theoretic approach ⋮ Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder ⋮ A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach
Uses Software
This page was built for publication: Algorithms - ESA 2003
