Sciweavers

23 search results - page 5 / 5
» Node-Weighted Steiner Tree and Group Steiner Tree in Planar ...
Sort
View
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
14 years 6 months ago
Finding Top-k Min-Cost Connected Trees in Databases
It is widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study ...
Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao...
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
13 years 6 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan
INFOCOM
2002
IEEE
13 years 9 months ago
Stability of a Multicast Tree
— Most of the currently deployed multicast protocols (e.g. DVMRP, PIM, MOSPF) build one shortest path multicast tree per sender, the tree being rooted at the sender’s subnetwor...
Piet Van Mieghem, Milena Janic