Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"A Polynomial-Time Algorithm for the Universally Quickest Transshipment ..."

Naoyuki Kamiyama, Naoki Katoh (2009)

> Home

Details and statistics

DOI: 10.1007/978-3-642-10631-6_81

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isaac/KamiyamaK09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/KamiyamaK09
Naoyuki Kamiyama, Naoki Katoh:
A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths. ISAAC 2009: 802-811

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.