Sciweavers

459 search results - page 31 / 92
» Approximation Algorithms for Buy-at-Bulk Geometric Network D...
Sort
View
138
Voted
IJCV
2012
13 years 6 months ago
Minimizing Energies with Hierarchical Costs
Abstract Computer vision is full of problems elegantly expressed in terms of energy minimization. We characterize a class of energies with hierarchical costs and propose a novel hi...
Andrew Delong, Lena Gorelick, Olga Veksler, Yuri B...
153
Voted
ISAAC
2004
Springer
170views Algorithms» more  ISAAC 2004»
15 years 9 months ago
Spanners, Weak Spanners, and Power Spanners for Wireless Networks
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
Christian Schindelhauer, Klaus Volbert, Martin Zie...
146
Voted
INFOCOM
2012
IEEE
13 years 6 months ago
Reverse-engineering BitTorrent: A Markov approximation perspective
Abstract—BitTorrent has been the most popular P2P (Peer-toPeer) paradigm during recent years. Built upon great intuition, the piece-selection and neighbor-selection modules roote...
Ziyu Shao, Hao Zhang, Minghua Chen, Kannan Ramchan...
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
15 years 5 months ago
Approximating connected facility location problems via random facility sampling and core detouring
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Ro...
COR
2007
108views more  COR 2007»
15 years 3 months ago
New primal-dual algorithms for Steiner tree problems
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
Vardges Melkonian