jabo17 / dynamis

Dynamic Vienna Maximum/maximal Independent Set Solver

Dynamic Maximum/Maximal Independent Set Solver

for unit-height rectangle intersection graphs

Github Page: https://dyna-mis.github.io/dynaMIS/

Requirements

1. CGAL (>= 4.11.2)
2. g++

# Description Our Framework contains 5 algorithms. * ors(rs) : a dynamic MIS algorithm based on orthogonal range searching (for unit squares) * graph(cg): a graph-based dynamic MIS algorithm * grid(sl): a grid-based 4-approximation algorithm （for unit squares） * gridK(slk): The group-shifting based algorithm. Need a extra parameter -k (for unit squares) * line(arrow): stabbing-line based 2-approximation algorithm ## Additionally, our framework supports the greedy optimization with the maximal independent set solver,i.e., grid, gridk, and line. The greedy versions drastically improve the solution quality, but typically at the cost of higher runtimes.

Installation

Compile the source with the Debug/Makefile file.

Usage

./dynaMIS [options]

--output, -o : output the solution
--help, -h : output this help
--algorithm, -a : algorithm in use, please using the abbreviations (see description above). To adding greedy optimization, just add 'g' to the algorithm name, e.g., 'garrow'.
--sigma, -s : width of a square

Acknowledgments

DynaMis is part of the project "Human-Centered Algorithm Engineering: Graph and Map Visualization" supported by the Austrian Science Fund (FWF) under Grant P31119.

Reference

More details see our paper "An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling"(ARXIV LINK)