Sciweavers

422 search results - page 53 / 85
» Shortest paths between shortest paths and independent sets
Sort
View
ISCC
2003
IEEE
135views Communications» more  ISCC 2003»
14 years 1 months ago
High Performance Routing in a LEO Satellite Network
Satellite systems are designed as a backup system to the existing land based wireless systems. Because of the global coverage of the system it becomes more economic for the rural ...
Roy Kucukates, Cem Ersoy
ICCI
1991
14 years 5 days ago
On the k-Coloring of Intervals
The problem of coloring a set of n intervals (from the real line) with a set of k colors is studied. In such a coloring, two intersecting intervals must receive distinct colors. O...
Martin C. Carlisle, Errol L. Lloyd
FOCS
1993
IEEE
14 years 23 days ago
An On-Line Algorithm for Improving Performance in Navigation
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
Avrim Blum, Prasad Chalasani
ICALP
1998
Springer
14 years 26 days ago
Static and Dynamic Low-Congested Interval Routing Schemes
Interval Routing Schemes (IRS for short) have been extensively investigated in the past years with special emphasis on shortest paths. Besides their theoretical interest, IRS have...
Serafino Cicerone, Gabriele Di Stefano, Michele Fl...
STACS
2005
Springer
14 years 2 months ago
Centrality Measures Based on Current Flow
Abstract. We consider variations of two well-known centrality measures, betweenness and closeness, with a different model of information spread. Rather than along shortest paths o...
Ulrik Brandes, Daniel Fleischer