4 papers
Optimal Padded Decomposition For Bounded Treewidth Graphs
Arnold Filtser, Tobias Friedrich, Davis Issac +4
A -padded decomposition of an edge-weighted graph is a stochastic decomposition into clusters of diameter at most such that for every vertex …
Parameterized Complexity of Vehicle Routing
Michelle Döring, Jan Fehse, Tobias Friedrich +6
The Vehicle Routing Problem (VRP) is a popular generalization of the Traveling Salesperson Problem. Instead of one salesperson traversing the entire weighted, undirected graph ,…
Binary -Center with Missing Entries: Structure Leads to Tractability
Farehe Soheil, Kirill Simonov, Tobias Friedrich
$\kC$ clustering is a fundamental classification problem, where the task is to categorize the given collection of entities into clusters and come up with a representative for e…
Combining Crown Structures for Vulnerability Measures
Katrin Casel, Tobias Friedrich, Aikaterini Niklanovits +2
Over the past decades, various metrics have emerged in graph theory to grasp the complex nature of network vulnerability. In this paper, we study two specific measures: (weighted)…