[DMANET] KaMIS v2.0 -- Karlsruhe Maximum Independent Sets

Release of KaMIS v2.0
-----------------------------------

We are pleased to announce the release of version 2.0 of our framework
KaMIS (Karlsruhe Maximum Independent Sets). So far our framework
contained an advanced evolutionary algorithm based on graph partitioning
and incorporates kernelization techniques to compute large independent
sets (resp. vertex covers) in huge sparse networks. Our algorithm uses
reduction techniques and recursively chooses vertices that are likely to
be in a large independent set, to then further kernelize the graph.

In version 2.0, we added branch and reduce codes for weighted
independent sets, local search for weighted independents sets, onlinemis
(a fast local search for unweighted independent sets, based on excluding
vertices from local search by insights gained from reductions) as well
as faster reductions.

The software is now released under the MIT license.

* open source implementation / website
https://karlsruhemis.github.io/

* on github
https://github.com/KarlsruheMIS/KaMIS

We are glad for any comments and error reports (or even bug fixes) that
you send us.

Demian Hespe, Sebastian Lamm, Christian Schulz, Darren Strash
Karlsruhe Institute of Technology (KIT), University of Vienna, and
Hamilton College
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************