Algorithmic extremal problems in combinatorial optimization

DOI10.1016/0196-6774(82)90022-0MaRDI QIDQ3956421zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(5)

• 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.
• Algorithms for the maximum satisfiability problem
• Probabilistic bounds and algorithms for the maximum satisfiability problem

This page was built for publication: Algorithmic extremal problems in combinatorial optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3956421)