The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the RD community, with numerous individuals, as well as with prestigious organizations and societies, LNCS has grown into the most comprehensive computer science research forum available.It is equivalent to the packet routing problem if we additionally require unit edge capacities, unit transit times, and integral flow values. ... e.g., using the Ford- Fulkerson algorithm for the maximum flow over time problem [7, 8, 22] together with a binary search framework. ... the destination vertices of all packets being pairwise different, we present an optimal algorithm which always computes a schedule ofanbsp;...
|Title||:||LATIN 2010: Theoretical Informatics|
|Publisher||:||Springer Science & Business Media - 2010-04-09|