Joachim Spoerhase und Matthias Mnich - Info zur Person

(1 - 8 von 8

)

Tutte Colloquium - Matthias Mnich | Combinatorics and Optimization |...

uwaterloo.ca

— Joint work with Joachim Spoerhase (Aalto) and Krzysztof Fleszar (Warsaw). Location. MC - Mathematics & Computer Building.

[ ] New Algorithms for Maximum Disjoint Paths Based on...

arxiv.org

Authors: Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase. (Submitted on 5 Mar (v1), last revised 20 May (this version, v2)). Abstract: We study the classical NP-hard problems of finding maximum-size subsets from given sets of terminal pairs that can be routed via edge-disjoint paths (MaxEDP) or ...

Search results for "Joachim Spoerhase" – FacetedDBLP

dblp.l3s.uni-hannover.de

Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase: New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. CoRR : 2016: DBLP BibTeX RDF: 1:

ALGO 2016

cs.au.dk

Faster External Memory LCP Array Construction · Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase New Algorithms for Maximum Disjoint Paths Based on ...

ALGO - Research - TUHH

www.tuhh.de

Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase: New algorithms for maximum disjoint paths based on tree-likeness. ESA › algo › resear...

DataCite Search

search.datacite.org

Krzysztof Fleszar, Matthias Mnich & Joachim Spoerhase. ConferencePaper published via Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany. We study the classical NP-hard problems of finding maximum-size subsets from given sets of k terminal pairs that can be routed via ...

Martin Fink
Axel Schmitz-Tewes
Jan-Henrik Haunert

Personen
Vorname "Joachim" (33841)
Name "Spoerhase" (16)

sortiert nach Relevanz / Datum

Erweiterte Suche

Person-Suchen: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Joachim Spoerhase und Matthias Mnich Person-Info

Tutte Colloquium - Matthias Mnich | Combinatorics and Optimization |...

[ ] New Algorithms for Maximum Disjoint Paths Based on...

Search results for "Joachim Spoerhase" – FacetedDBLP

ALGO 2016

ALGO - Research - TUHH

DataCite Search

New algorithms for maximum disjoint paths based on tree ...

Approximating Sparsest Cut in Low-Treewidth Graphs via ...

Alle Infos zum Namen "Joachim Spoerhase"