All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

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%2F01%3A00105541" target="_blank" >RIV/00216208:11320/01:00105541 - 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

    Approximation and online algorithms for NP-hard optimization graph problems

  • 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

    2001

  • 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

    Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures

  • ISBN

    1-58113-409-6

  • ISSN

  • e-ISSN

  • Number of pages

    10

  • Pages from-to

    38-47

  • Publisher name

    ACM

  • Place of publication

    USA

  • Event location

    USA

  • Event date

    Jan 1, 2001

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article