Oct 24, 2020 · This paper studies approximation algorithm for a graph theoretical model which was proposed by Zhang et al. [37] because of a security concern of WSN.

In this paper, we propose a related problem as follows: Given a graph G = (V , E) and a vertex-weight function w, the goal is to find a minimum weight vertex ...

For a given graph G, the minimum weight connected-k-subgraph cover problem (MinWCkSC) is to find a minimum weight vertex subset C of G such that each ...

Approximation algorithm for minimum weight connected-k-subgraph cover · Pengcheng Liu, Zhao Zhang, Xiaohui Huang · Published in Theoretical Computer Science 2 ...

Oct 22, 2024 · A k -approximation algorithm can be easily obtained by LP rounding method. Assuming that the girth of the graph is at least k , we reduce the ...

Jan 10, 2024 · Given a graph G, the minimum Connected-k-Subgraph Cover problem (MinCkSC) is to find a minimum vertex subset C of G such that every connected ...

This algorithm achieves approxima- tion ratio 1 + 2/k for digraphs and arbitrary k, as well as for undirected graphs and even k. For undirected graphs and odd k ...

Approximation algorithm for minimum weight connected-k-subgraph cover ; Journal: Theoretical Computer Science, 2020, p. 160-167 ; Publisher: Elsevier BV ; Authors: ...

In this paper, we study the problem of finding low-cost spanning subgraphs with given degrees that meet connectivity requirements (they should be k-edge-.

Abstract. We describe two new 3/2-approximation algorithms and a new 2-approximation algorithm for the minimum weight edge cover problem in graphs.