3 citations · 13 across the 8 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2018
Contracting to a Longest Path in H-Free Graphs
Walter Kern, Daniel Paulusma
We prove two dichotomy results for detecting long paths as patterns in a given graph. The NP-hard problem Longest Induced Path is to determine the longest induced path in a graph.…
cs.DS2016★ 3 cited
On the Factor Revealing LP Approach for Facility Location with Penalties
Xian Qiu, Walter Kern
We consider the uncapacitated facility location problem with (linear) penalty function and show that a modified JMS algorithm, combined with a randomized LP rounding technique due…