3 citations · 6 across the 5 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.CC2018
Tight Approximation Ratio for Minimum Maximal Matching
Szymon Dudycz, Mateusz Lewandowski, Jan Marcinkowski
We study a combinatorial problem called Minimum Maximal Matching, where we are asked to find in a general graph the smallest that can not be extended. We show that this problem is…
cs.DS2018
Approximating Node-Weighted k-MST on Planar Graphs
Jarosław Byrka, Mateusz Lewandowski, Joachim Spoerhase
We study the problem of finding a minimum weight connected subgraph spanning at least vertices on planar, node-weighted graphs. We give a $(4+\eps)$-approximation algorithm for…