Sciweavers

366 search results - page 34 / 74
» A new model for selfish routing
Sort
View
SODA
1998
ACM
99views Algorithms» more  SODA 1998»
15 years 1 months ago
Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
Ashish Goel, Monika Rauch Henzinger, Serge A. Plot...
MOBICOM
1998
ACM
15 years 4 months ago
A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols
An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administra...
Josh Broch, David A. Maltz, David B. Johnson, Yih-...
FOCS
2006
IEEE
15 years 6 months ago
Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
Niv Buchbinder, Joseph Naor
EENERGY
2010
15 years 3 months ago
GreenCoop: cooperative green routing with energy-efficient servers
Energy-efficient communication has recently become a key challenge for both researchers and industries. In this paper, we propose a new model in which a Content Provider and an In...
Luca Chiaraviglio, Ibrahim Matta
EVOW
2008
Springer
15 years 1 months ago
A Hybrid Column Generation Approach for the Berth Allocation Problem
Abstract. The Berth Allocation Problem (BAP) consists on programming and allocating ships to berthing areas along a quay. The BAP is modeled as a vehicle routing problem and a rece...
Geraldo R. Mauri, Alexandre C. M. Oliveira, Luiz A...