13 citations · 38 across the 17 of their papers we have counts for
Showing 2019 · cs.CCShow all
2 papers · 2 filters
cs.CC2019
Improved (In-)Approximability Bounds for d-Scattered Set
Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
In the -Scattered Set problem we are asked to select at least vertices of a given graph, so that the distance between any pair is at least . We study the problem's (in-)a…
cs.CC2019★ 1 cited
A polynomial time approximation schema for maximum k-vertex cover in bipartite graphs
Vangelis Th. Paschos
The paper presents a polynomial time approximation schema for the edge-weighted version of maximum k-vertex cover problem in bipartite graphs.