Simple On-Line Algorithms for the Maximum Disjoint Paths Problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F04%3A00002880" target="_blank" >RIV/00216208:11320/04:00002880 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Simple On-Line Algorithms for the Maximum Disjoint Paths Problem
Original language description
We improve the analysis of the greedy algorithm for the maximum edge dosjpint paths problem, and also describe a new algorithm with better performance.
Czech name
Jednoduche algoritmy pro problem hledani maximalniho poctu disjunktnich cest
Czech description
Vylepsujeme analyzu hladoveho algoritmu pro problem hledani maximalniho poctu disjunktnich cest v grafu a navrhujeme novy algoritmus s lepsim aproximacnim pomerem.
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
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
2004
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
Name of the periodical
Algorithmica
ISSN
0178-4617
e-ISSN
—
Volume of the periodical
39
Issue of the periodical within the volume
3
Country of publishing house
US - UNITED STATES
Number of pages
25
Pages from-to
209-233
UT code for WoS article
—
EID of the result in the Scopus database
—