A hop constrained min-sum arborescence with outage costs
Computers and Operations Research
On the bounded-hop MST problem on random Euclidean instances
Theoretical Computer Science
Minimum-Energy Broadcast and disk cover in grid wireless networks
Theoretical Computer Science
Computers and Operations Research
Analysis of the bounded-hops converge-cast distributed protocol in ad-hoc networks
ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
The k-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation
Discrete Applied Mathematics
Efficient execution plans for distributed skyline query processing
Proceedings of the 14th International Conference on Extending Database Technology
On the weight-constrained minimum spanning tree problem
INOC'11 Proceedings of the 5th international conference on Network optimization
A distributed protocol for the bounded-hops converge-cast in ad-hoc networks
ADHOC-NOW'06 Proceedings of the 5th international conference on Ad-Hoc, Mobile, and Wireless Networks
Minimum energy broadcast and disk cover in grid wireless networks
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Divide and conquer is almost optimal for the bounded-hop MST problem on random euclidean instances
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
The Steiner Tree Problem with Delays: A compact formulation and reduction procedures
Discrete Applied Mathematics
Lower and upper bounds for the spanning tree with minimum branch vertices
Computational Optimization and Applications
| Hi-index | 0.01 |