64 search results - page 3 / 13 » On the Capacity of Capacitated Automata |
INFORMS
2008
13 years 5 months ago
2008
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
MST
2010
13 years 8 days ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
EOR
2007
13 years 5 months ago
2007
Abstract. In this paper, we present a simple polynomial-time algorithm solving the shortest multipaths problem in particular grid graphs called dense channels. Our work extends the...
ESCAPE
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In the online capacitated interval coloring problem, a sequence of requests arrive online. Each of the requests is an interval Ij ⊆ {1, 2, . . . , n} with bandwidth bj....
SODA
2010
ACM
14 years 2 months ago
2010
ACM
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...