3016 search results - page 65 / 604 » The Online Transportation Problem |
128
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
In this paper the online pull-based broadcast model is considered. In this model, there are n pages of data stored at a server and requests arrive for pages online. When the serve...
133
Voted
ORDER
2007
15 years 3 months ago
2007
On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5w −1 4 chains to cover poset of width w. Felsner ...
192
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—The paper deals with efficient distribution of timely information to flows of mobile devices. We consider the case where a set of Information Dissemination Devices (IDDs) broa...
154
Voted
CCCG
2003
15 years 5 months ago
2003
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
128
Voted
ALGORITHMICA
2010
15 years 3 months ago
2010
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...