4 citations · 7 across the 3 of their papers we have counts for
3 papers
Incorporating Road Networks into Territory Design
Nitin Ahuja, Matthias Bender, Peter Sanders +2
Given a set of basic areas, the territory design problem asks to create a predefined number of territories, each containing at least one basic area, such that an objective function…
n-Level Hypergraph Partitioning
Vitali Henne, Henning Meyerhenke, Peter Sanders +2
We develop a multilevel algorithm for hypergraph partitioning that contracts the vertices one at a time and thus allows very high quality. This includes a rating function that avoi…
Graph Partitioning for Independent Sets
Sebastian Lamm, Peter Sanders, Christian Schulz
Computing maximum independent sets in graphs is an important problem in computer science. In this paper, we develop an evolutionary algorithm to tackle the problem. The core innova…