# Improved approximation algorithms for k-connected m-dominating set problems

Information Processing Letters, pp. 30-33, 2018.

EI

Abstract:

A graph is k-connected if it has k pairwise internally node disjoint paths between every pair of its nodes. A subset S of nodes in a graph G is a k-connected set if the subgraph G[S] induced by S is k-connected; S is an m-dominating set if every v∈V∖S has at least m neighbors in S. If S is both k-connected and m-dominating then S is a k-c...More

Code:

Data:

Get fulltext within 24h

Upload PDF

1.Your uploaded documents will be check within 24h, and coins will be credited to your account.

2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.

3.10 coins will be exchanged for 1 yuan.

?

￥

Upload a single paper

for 5 coins

Wechat's Red Packet

?

￥

Upload 50 articles

for 280 coins

Wechat's Red Packet

?

￥

Upload 200 articles

for 1200 coins

Wechat's Red Packet

?

￥

Upload 500 articles

for 3000 coins

Wechat's Red Packet

?

￥

Upload 1000 articles

for 7000 coins

Wechat's Red Packet

Tags

Comments