Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Alexander Noe"'
Autor:
Faisal N. Abu-Khzam, Sebastian Lamm, Matthias Mnich, Alexander Noe, Christian Schulz, Darren Strash
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031215339
Over the last two decades, significant advances have been made in the design and analysis of fixed-parameter algorithms for a wide variety of graph-theoretic problems. This has resulted in an algorithmic toolbox that is by now well-established. Howev
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::784674cae6b8aba8b52c51fc578e170d
https://doi.org/10.1007/978-3-031-21534-6_6
https://doi.org/10.1007/978-3-031-21534-6_6
Autor:
Nikos Parotsidis, Mauricio G. C. Resende, Alexander Noe, Andrew V. Goldberg, Quico Spaen, Yuanyuan Dong
Publikováno v:
Dong, Y, Goldberg, A V, Noe, A, Parotsidis, N, Resende, M G C & Spaen, Q 2021, ' New Instances for Maximum Weight Independent Set From a Vehicle Routing Application ', Operations Research Forum, vol. 2, no. 4, 48 . https://doi.org/10.1007/s43069-021-00084-x
We present a set of new instances of the maximum weight independent set problem. These instances are derived from a real-world vehicle routing problem and are challenging to solve in part because of their large size. We present instances with up to 8
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::faee595ab2917e7911732df8d54c0c93
http://arxiv.org/abs/2105.12623
http://arxiv.org/abs/2105.12623
Computing high-quality graph partitions is a challenging problem with numerous applications. In this article, we present a novel meta-heuristic for the balanced graph partitioning problem. Our approach is based on integer linear programs that solve t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cf4e18e1081793072161ee056aa3f18a
http://arxiv.org/abs/1802.07144
http://arxiv.org/abs/1802.07144
Publikováno v:
IPDPS
The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weight sum of the cut edges. In this paper, we engineer the fastest known exact algorithm for the problem. State-of-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0ed94d5b29b77d081c107ed918700533
The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weight sum of the cut edges. Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our algorithm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::91dfa12de37aa824bf0f63a3fdb7a063
Autor:
Matthias Stumpp, Sebastian Schlag, Peter Sanders, Emanuel Jobstl, Alexander Noe, Tobias Sturm, Huyen Chau Nguyen, Timo Bingmann, Michael Axtmann, Sebastian Lamm
Publikováno v:
IEEE BigData
We present the design and a first performance evaluation of Thrill -- a prototype of a general purpose big data processing framework with a convenient data-flow style programming interface. Thrill is somewhat similar to Apache Spark and Apache Flink
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1b07e56dcccc897d783b1d59a48f9f33