Sciweavers

459 search results - page 18 / 92
» Approximation Algorithms for Buy-at-Bulk Geometric Network D...
Sort
View
ORL
1998
136views more  ORL 1998»
13 years 8 months ago
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
Recently, Becker and Geiger and Bafna, Berman and Fujito gave 2-approximation algorithms for the feedback vertex set problem in undirected graphs. We show how their algorithms can...
Fabián A. Chudak, Michel X. Goemans, Dorit ...
WEA
2005
Springer
89views Algorithms» more  WEA 2005»
14 years 2 months ago
Implementation of Approximation Algorithms for the Multicast Congestion Problem
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
Qiang Lu, Hu Zhang
PG
2000
IEEE
14 years 29 days ago
Dynamic PDE Surfaces with Flexible and General Geometric Constraints
PDE surfaces, whose behavior is governed by Partial Differential Equations (PDEs), have demonstrated many modeling advantages in surface blending, free-form surface modeling, and ...
Haixia Du, Hong Qin
IJCNN
2008
IEEE
14 years 3 months ago
On the sample mean of graphs
— We present an analytic and geometric view of the sample mean of graphs. The theoretical framework yields efficient subgradient methods for approximating a structural mean and ...
Brijnesh J. Jain, Klaus Obermayer
MOBIHOC
2010
ACM
13 years 6 months ago
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
Anne-Marie Kermarrec, Guang Tan