Zobrazeno 1 - 10
of 89
pro vyhledávání: '"Markus Chimani"'
Publikováno v:
Mathematical Methods of Operations Research. 96:149-160
A recent paper by Schulze et al. (Math Methods Oper Res 92(1):107–132, 2020) presented the Rectangular Knapsack Problem (Rkp) as a crucial subproblem in the study on the Cardinality-constrained Bi-objective Knapsack Problem (Cbkp). To this end, the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6903348442e2b712da11a20be90d8a9d
https://doi.org/10.1007/s00186-022-00788-8
https://doi.org/10.1007/s00186-022-00788-8
Publikováno v:
IEEE/ACM Transactions on Networking. 29:262-274
Traffic engineering is an important concept that allows Internet Service Providers (ISPs) to utilize their existing routing hardware more efficiently. One technology that can be used is Segment Routing (SR). In this paper, we address the use of SR to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9dacb8212331f9fb9e069b297996da2c
https://doi.org/10.1109/tnet.2020.3030543
https://doi.org/10.1109/tnet.2020.3030543
Autor:
Markus Chimani, Stephan Beyer
Publikováno v:
ACM Journal of Experimental Algorithmics. 24:1-33
In this experimental study we consider Steiner tree approximations that guarantee a constant approximation of ratio smaller than $2$. The considered greedy algorithms and approaches based on linear programming involve the incorporation of $k$-restric
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7cd1c7c85827e37dabd0f26582cc4d8b
https://doi.org/10.1145/3299903
https://doi.org/10.1145/3299903
Autor:
Michael A. Bekos, Markus Chimani
This two-volume set LNCS 14465-14466 constitutes the proceedings of the 31st International Symposium on Graph Drawing and Network Visualization, GD 2023, held in Isola delle Femmine, Palermo, Italy, in September 2023. The 31 full papers, 7 short p
Autor:
Drago Bokal, Markus Chimani, Alexander Nover, Jöran Schierbaum, Tobias Stolzmann, Mirko H. Wagner, Tilo Wiedera
A $c$-crossing-critical graph is one that has crossing number at least $c$ but each of its proper subgraphs has crossing number less than $c$. Recently, a set of explicit construction rules was identified by Bokal, Oporowski, Richter, and Salazar to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e2d3be51357887211febda8f68ce2908
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030929305
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c47b8074f964f6c4541fb729a5b0e8a6
https://doi.org/10.1007/978-3-030-92931-2_3
https://doi.org/10.1007/978-3-030-92931-2_3
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030799861
IWOCA
IWOCA
In multistage perfect matching problems, we are given a sequence of graphs on the same vertex set and are asked to find a sequence of perfect matchings, corresponding to the sequence of graphs, such that consecutive matchings are as similar as possib
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d40fb097ab3ef599137e97ceb57771f4
https://doi.org/10.1007/978-3-030-79987-8_39
https://doi.org/10.1007/978-3-030-79987-8_39
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030532611
ISCO
ISCO
Given a graph \(G=(V,E)\), the LongestInducedPath problem asks for a maximum cardinality node subset \(W\subseteq V\) such that the graph induced by W is a path. It is a long established problem with applications, e.g., in network analysis. We propos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d5050e1bd9b901fda3a9d267c1c65534
https://doi.org/10.1007/978-3-030-53262-8_8
https://doi.org/10.1007/978-3-030-53262-8_8
In multistage perfect matching problems we are given a sequence of graphs on the same vertex set and asked to find a sequence of perfect matchings, corresponding to the sequence of graphs, such that consecutive matchings are as similar as possible. M
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b31d99cee9d89702044defd95d8d27b6