Sciweavers

1578 search results - page 32 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
PIMRC
2008
IEEE
14 years 3 months ago
Joint routing and scheduling for maximizing fair throughput in WiMAX mesh network
—WiMAX mesh mode, recently standardized, enables direct communications between subscriber stations without referring to the base station (BS). It can be a great solution for prov...
Salim Nahle, Naceur Malouch
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
11 years 11 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák
DIALM
2005
ACM
104views Algorithms» more  DIALM 2005»
13 years 10 months ago
Information dissemination in highly dynamic graphs
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
Regina O'Dell, Roger Wattenhofer
INFOCOM
2009
IEEE
14 years 3 months ago
Visibility-Graph-Based Shortest-Path Geographic Routing in Sensor Networks
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
Guang Tan, Marin Bertier, Anne-Marie Kermarrec
TON
1998
145views more  TON 1998»
13 years 8 months ago
Adaptive wavelength routing in all-optical networks
Abstract—In this paper we consider routing and wavelength assignment in wavelength-routed all-optical networks with circuitswitching. The conventional approaches to address this ...
Ahmed Mokhtar, Murat Azizoglu