Approximating activation edge-cover and facility location problems
arXiv: Data Structures and Algorithms, Volume abs/1812.09880, 2018.
EI
Abstract:
What approximation ratio can we achieve for the Facility Location problem if whenever a client $u$ connects to a facility $v$,the opening cost of $v$ is at most $theta$ times the service cost of $u$? We show that this and many other problems are a particular case of the Activation Edge-Cover problem. Here we are given a multigraph $G=(V,E...More
Code:
Data:
Get fulltext within 24h
Other Links
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