Sciweavers

1405 search results - page 12 / 281
» Popularity at Minimum Cost
Sort
View
94
Voted
FOCS
2009
IEEE
15 years 4 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
15 years 4 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»
15 years 3 months ago
Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs
Gregory Gutin, Arash Rafiey, Anders Yeo, Michael T...
SOFSEM
2005
Springer
15 years 3 months ago
Cost-Constrained Minimum-Delay Multicasting
Satoshi Tayu, Turki Ghazi Al-Mutairi, Shuichi Ueno