Approximating Steiner trees and forests with minimum number of Steiner points

Journal of Computer and System Sciences, pp. 53-64, 2018.

Cited by: 0|Views2


Let R be a finite set of terminals in a convex metric space (M,d). We give approximation algorithms for problems of finding a minimum size set S⊆M of additional points such that the unit-disc graph G[R∪S] of R∪S satisfies some connectivity properties. Let Δ be the maximum number of independent points in a unit ball. For the Steiner Tree w...More



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
Your rating :