4 papers
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth
Tobias Friedrich, Davis Issac, Nikhil Kumar +2
We prove an approximate max-multiflow min-multicut theorem for bounded treewidth graphs. In particular, we show the following: Given a treewidth- graph, there exists a (fraction…
Analysis of a Gray-Box Operator for Vertex Cover
Samuel Baguley, Tobias Friedrich, Timo Kötzing +3
Combinatorial optimization problems are a prominent application area of evolutionary algorithms, where the (1+1) EA is one of the most investigated. We extend this algorithm by int…
Connected -partition of -connected graphs and -claw-free graphs
Ralf Borndörfer, Katrin Casel, Davis Issac +3
A connected partition is a partition of the vertices of a graph into sets that induce connected subgraphs. Such partitions naturally occur in many application areas such as road ne…
Balanced Crown Decomposition for Connectivity Constraints
Katrin Casel, Tobias Friedrich, Davis Issac +2
We introduce the balanced crown decomposition that captures the structure imposed on graphs by their connected induced subgraphs of a given size. Such subgraphs are a popular model…