Sciweavers

1405 search results - page 12 / 281
» Popularity at Minimum Cost
Sort
View
FOCS
2009
IEEE
14 years 2 months ago
Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
Zeev Nutov
INFOCOM
2008
IEEE
14 years 1 months ago
Maximum Coverage at Minimum Cost for Multi-Domain IP/MPLS Networks
Marcelo Yannuzzi, Xavier Masip-Bruin, René ...
AAIM
2005
Springer
173views Algorithms» more  AAIM 2005»
14 years 28 days ago
Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs
Gregory Gutin, Arash Rafiey, Anders Yeo, Michael T...
SOFSEM
2005
Springer
14 years 26 days ago
Cost-Constrained Minimum-Delay Multicasting
Satoshi Tayu, Turki Ghazi Al-Mutairi, Shuichi Ueno