Daniel R. Schmidt
University of Bonn
22 Papers
110 Citations
Daniel R. Schmidt is an academic researcher from University of Bonn. The author has contributed to research in topics: Linear programming & Graph (abstract data type). The author has an hindex of 7, co-authored 20 publications. Previous affiliations of Daniel R. Schmidt include University of Cologne & Carnegie Mellon University.
Chat about Author
Papers
On the cost of essentially fair clusterings
Ioana Oriana Bercea,Martin Groß,Samir Khuller,Aounon Kumar,Clemens Rösner,Daniel R. Schmidt,Melanie Schmidt +6 more
- 01 Sep 2019
TL;DR: In this article, the authors proposed a relaxed fairness notion under which they can give bicriteria constant-factor approximations for all of the classical clustering objectives k-center, k-supplier, kmedian, kmeans and facility location.
52
Single-commodity robust network design with finite and Hose demand sets
TL;DR: This work proposes a branch-and-cut algorithm to derive optimal solutions to sRND, built on a capacity-based integer linear programming formulation, which contains exponentially many constraints.
Leukocyte depletion in allogeneic blood transfusion does not change the negative influence on survival following transthoracic resection for esophageal cancer.
Frederike C. Ling,Arnulf H. Hoelscher,Daniel Vallböhmer,Daniel R. Schmidt,Susanne M. Picker,Birgit S. Gathof,Elfriede Bollschweiler,Paul M. Schneider +7 more
TL;DR: The need for perioperative allogeneic blood transfusions is significantly associated with poorer survival following resection for esophageal cancer by univariate and multivariate analysis and it is suggested that the reduction of leukocyte-depleted in allogeneo- transfusion is not sufficient to overcome the negative influence on survival.
24
Approximating earliest arrival flows in arbitrary networks
Martin Groß,Jan-Philipp W. Kappmeier,Daniel R. Schmidt,Melanie Schmidt +3 more
- 10 Sep 2012
TL;DR: It is shown that there is always a 2-value-approximation of earliest arrival flows and that no better approximation factor is possible in general.
20
Single-commodity robust network design problem: Complexity, instances and heuristic solutions
Eduardo Álvarez-Miranda,Eduardo Álvarez-Miranda,Valentina Cacchiani,Andrea Lodi,Tiziano Parriani,Daniel R. Schmidt +5 more
TL;DR: A single-commodity Robust Network Design problem (RND) in which an undirected graph with edge costs is given together with a discrete set of balance matrices, representing different supply/demand scenarios, is studied.
11