30 citations · 158 across the 36 of their papers we have counts for
Showing 2014 · cs.CCShow all
2 papers · 2 filters
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.CC2014
The Minimum Feasible Tileset problem
Yann Disser, Stefan Kratsch, Manuel Sorge
We introduce and study the Minimum Feasible Tileset problem: Given a set of symbols and subsets of these symbols (scenarios), find a smallest possible number of pairs of symbols (t…