20 citations · 33 across the 6 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DS2014★ 20 cited
Constant-factor approximations for Capacitated Arc Routing without triangle inequality
René van Bevern, Sepp Hartung, André Nichterlein +1
Given an undirected graph with edge costs and edge demands, the Capacitated Arc Routing problem (CARP) asks for minimum-cost routes for equal-capacity vehicles so as to satisfy all…
cs.SI2014★ 6 cited
Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks
Sepp Hartung, Clemens Hoffmann, André Nichterlein
Motivated by a strongly growing interest in anonymizing social network data, we investigate the NP-hard Degree Anonymization problem: given an undirected graph, the task is to add…