Jan 10, 2019 · We develop efficient parameterized, with additive error, approximation algorithms for the (Connected) r-Domination problem and the ...
Jun 22, 2017 · Abstract:We develop efficient parameterized, with additive error, approximation algorithms for the (Connected) r-Domination problem and the ...
Jan 10, 2019 · We develop efficient parameterized, with additive error, approximation algorithms for the (Connected) r-Domination problem and the ...
We develop efficient parameterized, with additive error, approximation algorithms for the (Connected) r-Domination problem and the (Connected) p-Center ...
Parameterized Approximation Algorithms for some ... - NASA ADS
ui.adsabs.harvard.edu › abs › abstract
We develop efficient parameterized, with additive error, approximation algorithms for the (Connected) $r$-Domination problem and the (Connected) $p$-Center ...
(Connected) r-Domination Problem. For a given graph G = (V,E) and given function r : V → N, determine a. (connected) vertex set D with minimum cardinality ...
Request PDF | On Jan 1, 2017, Arne Leitert and others published Parameterized Approximation Algorithms for Some Location Problems in Graphs | Find, ...
We develop efficient parameterized, with additive error, approximation algorithms for the (Connected) r-Domination problem and the (Connected) p-Center ...
Approximation algorithms and parameterized complexity are usually considered to be two separate ways of dealing with hard algorithmic problems.
Abstract. We study the Traveling Salesman problem (TSP), where given a complete undirected graph G = (V,E) with n vertices and an edge cost function c : E ...