Sciweavers

2343 search results - page 272 / 469
» The Locomotive Routing Problem
Sort
View
BROADNETS
2006
IEEE
15 years 10 months ago
Spare Capacity Provisioning for Dynamic Traffic Grooming in Optical Networks
Abstract-- Optical Networks with wavelength routing are expected to form the backbone in the next generation wide area networks. The traffic grooming problem in optical networks is...
Shu Huang, Rudra Dutta
IPL
2006
97views more  IPL 2006»
15 years 6 months ago
A fixed-parameter tractability result for multicommodity demand flow in trees
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
Jiong Guo, Rolf Niedermeier
STOC
2004
ACM
131views Algorithms» more  STOC 2004»
16 years 6 months ago
(Almost) tight bounds and existence theorems for confluent flows
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...
SIGMOD
2003
ACM
154views Database» more  SIGMOD 2003»
16 years 6 months ago
The Cougar Project: a work-in-progress report
We present an update on the status of the Cougar Sensor Database Project, in which we are investigating a database approach to sensor networks: Clients "program" the sen...
Alan J. Demers, Johannes Gehrke, Rajmohan Rajarama...
CIKM
2009
Springer
16 years 1 months ago
A mobile tourist assistance and recommendation system based on complex networks
In recent years, the tourism assistance community is gradually shifting its emphasis to digital, interactive systems. Our project aims for digital tourism assistance by combining ...
Alf-Christian Schering, Martin Dueffer, Andreas Fi...