关注
Markus Blumenstock
Markus Blumenstock
Teaching Associate, Johannes Gutenberg University Mainz
在 uni-mainz.de 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
A constructive arboricity approximation scheme
M Blumenstock, F Fischer
International Conference on Current Trends in Theory and Practice of …, 2020
172020
Algorithms for the Maximum Weight Connected k-Induced Subgraph Problem
E Althaus, M Blumenstock, A Disterhoft, A Hildebrandt, M Krupp
International Conference on Combinatorial Optimization and Applications, 268-282, 2014
152014
Algorithms for the maximum weight connected subgraph and prize-collecting Steiner tree problems
E Althaus, M Blumenstock
Unpublished manuscript at http://dimacs11. cs. princeton. edu/workshop. html, 2014
132014
Fast Algorithms for Pseudoarboricity
M Blumenstock
2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and …, 2016
112016
Pseudoforest Partitions and the Approximation of Connected Subgraphs of High Density
MAD Blumenstock
University of Mainz, 2020
22020
系统目前无法执行此操作，请稍后再试。
文章 1–5