Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Tobias Pröger"'
Publikováno v:
Computer Science – Theory and Applications CSR 2016, 102-116
STARTPAGE=102;ENDPAGE=116;TITLE=Computer Science – Theory and Applications CSR 2016
Computer Science – Theory and Applications ISBN: 9783319341705
CSR
STARTPAGE=102;ENDPAGE=116;TITLE=Computer Science – Theory and Applications CSR 2016
Computer Science – Theory and Applications ISBN: 9783319341705
CSR
Given a set of directed paths (called lines) l, a public transportation network is a directed graph g_l=(v_l,a_l)g_l=(v_l,a_l) which contains exactly the vertices and arcs of every line l\in ll\in l. An st-route is a pair (\pi ,\gamma )(\pi ,\gamma )
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6fed921fabeedc687efda8d1ac3d4702
https://doi.org/10.1007/978-3-319-34171-2_8
https://doi.org/10.1007/978-3-319-34171-2_8
Autor:
Gustavo Sacomoto, Luca Häfliger, Marie-France Sagot, Kateřina Böhmová, Matúš Mihalák, Tobias Pröger
Publikováno v:
Theory of Computing Systems, 62 (3)
Theory of Computing Systems, 62(3), 600-621. Springer Verlag
Theory of Computing Systems, 62(3), 600-621. Springer Verlag
Given a set of directed paths (called lines) L, a public transportation network is a directed graph G L = (V L , A L ) which contains exactly the vertices and arcs of every line l ∈ L. An st-route is a pair (π, γ) where γ = 〈l 1,…, l h 〉 i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fedb82073fc4f46186c49e50e3a75cb7
https://hdl.handle.net/20.500.11850/128244
https://hdl.handle.net/20.500.11850/128244
Autor:
Matúš Mihalák, Rastislav Šrámek, Peter Widmayer, Tobias Pröger, Joachim M. Buhmann, Alexey Gronskiy
Publikováno v:
Journal of Computer and System Sciences, 94
Journal of Computer and System Sciences, 94, 135-166. Academic Press Inc.
Journal of Computer and System Sciences, 94, 135-166. Academic Press Inc.
We propose a novel approach for optimization under uncertainty. Our approach does not assume any particular noise model behind the measurements, and only requires two typical instances. We first propose a measure of similarity of instances (with resp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::689bb050b4e33fb4d8f523f2fdf588c3
Autor:
Beate Bollig, Tobias Pröger
Publikováno v:
Information and Computation. 239:29-43
The maximal matching problem, i.e., the computation of a matching that is not a proper subset of another matching, is a fundamental optimization problem, and maximal matching algorithms have been used as submodules for problems like maximal node-disj
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6bca9c2aa6dea709ae57c21c392230ba
https://doi.org/10.1016/j.ic.2014.08.006
https://doi.org/10.1016/j.ic.2014.08.006
Publikováno v:
Theoretical Computer Science. 560:131-146
The maximum bipartite matching problem, an important problem in combinatorial optimization, has been studied for a long time. In order to solve problems for very large structured graphs in reasonable time and space, implicit algorithms have been inve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::472e766e7a9b0d957a75d4a2d191714d
https://doi.org/10.1016/j.tcs.2014.07.020
https://doi.org/10.1016/j.tcs.2014.07.020
Publikováno v:
Informatik-Spektrum. 28:53-56
Die Offnung der Universitat fur Schulerinnen und Schuler hat verschiedene Zielsetzungen und nimmt unterschiedliche Formen an.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::408cc08fb45a41d625ed315b491e8528
https://doi.org/10.1007/s00287-004-0453-2
https://doi.org/10.1007/s00287-004-0453-2
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642299513
TAMC
TAMC
The maximum bipartite matching problem, an important problem in combinatorial optimization, has been studied for a long time. In order to solve problems for very large structured graphs in reasonable time and space, implicit algorithms have been inve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::51882457a664673812b021f75e7fd950
https://doi.org/10.1007/978-3-642-29952-0_45
https://doi.org/10.1007/978-3-642-29952-0_45
Autor:
Tobias Pröger, Beate Bollig
Publikováno v:
Language and Automata Theory and Applications ISBN: 9783642283314
LATA
LATA
The maximal matching problem, i.e., the computation of a matching that is not a proper subset of another matching, is a fundamental optimization problem and algorithms for maximal matchings have been used as submodules for problems like maximal node-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aa1b7fadc9ab1231b1e85e567656341e
https://doi.org/10.1007/978-3-642-28332-1_13
https://doi.org/10.1007/978-3-642-28332-1_13