On polynomial-time combinatorial algorithms for maximum L-bounded flow

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F19%3A10404791" target="_blank" >RIV/00216208:11320/19:10404791 - isvavai.cz</a>

Result on the web

<a href="https://doi.org/10.1007/978-3-030-24766-9_2" target="_blank" >https://doi.org/10.1007/978-3-030-24766-9_2</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-24766-9_2" target="_blank" >10.1007/978-3-030-24766-9_2</a>

Result language

angličtina

Original language name

On polynomial-time combinatorial algorithms for maximum L-bounded flow

Original language description

We describe a combinatorial algorithm based on the exponential length method that finds a (1+ε) -approximation of the maximum L-bounded flow. Moreover, we show that this approach works even for the NP-hard generalization of the maximum L-bounded flow problem in which each edge has a length.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/GA17-09142S" target="_blank" >GA17-09142S: Modern algorithms: New challenges of complex data sets</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2019

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Algorithms and Data Structures;16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019, Proceedings

ISBN

978-3-030-24765-2

ISSN

0302-9743

e-ISSN

—

Number of pages

14

Pages from-to

14-27

Publisher name

Springer

Place of publication

Cham

Event location

Edmonton, Canada

Event date

Aug 5, 2019

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—