Algorithmic extremal problems in combinatorial optimization

DOI10.1016/0196-6774(82)90022-0zbMath0493.68073OpenAlexW2090880042MaRDI QIDQ3956421

Karl J. Lieberherr

Publication date: 1982

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(82)90022-0

zbMATH Keywords

efficient approximation algorithm generatorgeneralized maximum satisfiability problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)

Related Items

Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem, Implications of forbidden structures for extremal algorithmic problems, Complexity of partial satisfaction. II., Probabilistic bounds and algorithms for the maximum satisfiability problem, Algorithms for the maximum satisfiability problem