Algorithms for Fault-Tolerant Routing in Circuit Switched Networks
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F02%3A00003207" target="_blank" >RIV/00216208:11320/02:00003207 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Algorithms for Fault-Tolerant Routing in Circuit Switched Networks
Original language description
A study of 'fault-tolerant' extensions of the edge disjoint paths problem, the k-edge disjoint paths problem and the k-disjoint flow problem. Approximation and online algorithms.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/LN00A056" target="_blank" >LN00A056: Institute of Theoretical Computer Science (Center of Young Science)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2002
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proc. of 14 ACM Symposium on Parallel Algorithms and Architectures
ISBN
1-58113-529-7
ISSN
—
e-ISSN
—
Number of pages
10
Pages from-to
265-274
Publisher name
ACM Press
Place of publication
USA, New York
Event location
USA, New York
Event date
Jan 1, 2002
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—