𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On approximation algorithms for the minimum satisfiability problem

✍ Scribed by M.V. Marathe; S.S. Ravi


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
617 KB
Volume
58
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Algorithms for the minimum partitioning
✍ Hiroshi Nagamochi πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 545 KB

## Abstract In this paper, the author explains the recent evolution of algorithms for minimum partitioning problems in graphs. When the set of vertices of a graph having non‐negative weights for edges is divided into __k__ subsets, the set of edges for which both endpoints are contained in differen