20 citations · 23 across the 3 of their papers we have counts for
3 papers
cs.CC2014★ 2 cited
On Kernelization and Approximation for the Vector Connectivity Problem
Stefan Kratsch, Manuel Sorge
In the Vector Connectivity problem we are given an undirected graph , a demand function , and an integer . The question is whether there exi…
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.DM2010★ 1 cited
Algorithmic Aspects of Golomb Ruler Construction
Manuel Sorge
We consider Golomb rulers and their construction. Common rulers feature marks at every unit measure, distances can often be measured with numerous pairs of marks. On Golomb rulers,…