Christoph Dürr

Dr. Christoph Dürr

CNRS, Sorbonne University

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 July 2020 in Algorithmica
Verified
Journal Article
Closed access
PDF file
CDChristoph Dürr
Christoph Dürr
TEThomas Erlebach
Thomas Erlebach
NMNicole Megow
Nicole Megow
JMJulie Meißner
Julie Meißner

18 April 2024 in Journal of Computer and System Sciences
Verified
Journal Article
Closed access
SASpyros Angelopoulos
Spyros Angelopoulos
CDChristoph Dürr
Christoph Dürr
SJShendan Jin
Shendan Jin
SKShahin Kamali
Shahin Kamali
MRMarc Renault
Marc Renault

3 September 2020 in Journal of Combinatorial Optimization
Verified
Journal Article
Closed access
PDF file
SASpyros Angelopoulos
Spyros Angelopoulos
CDChristoph Dürr
Christoph Dürr
SJShendan Jin
Shendan Jin

16 January 2016 in Journal of Scheduling
Verified
Journal Article
Closed access
PDF file
NBNikhil Bansal
Nikhil Bansal
CDChristoph Dürr
Christoph Dürr
NTNguyen Kim Thang
Nguyen Kim Thang
ÓVÓscar C. Vásquez
Óscar C. Vásquez

1 January 2020 in Operations Research
Verified
Journal Article
Closed access
MBMarcin Bienkowski
Marcin Bienkowski
MBMartin Böhm
Martin Böhm
JBJaroslaw Byrka
Jaroslaw Byrka
MCMarek Chrobak
Marek Chrobak
CDChristoph Dürr
Christoph Dürr
PVPavel Veselý
Pavel Veselý
Online Algorithms for Hierarchical Aggregation Problems Data and inventory aggregation problems arise in multicasting, sensor networks, communication in organization hierarchies, and in supply chain management. These problems are naturally online, in the sense that aggregation decisions need to be made without information about future requests. We study these problems with a general tree structure of links that can be used for deliveries. This generalizes some well-studied optimization problems: trees of depth one capture the TCP acknowledgment problem, and trees of depth two capture the joint replenishment problem. For trees of depth one and two, constant-competitive online algorithms are known. We solve a major open problem by giving a constant-competitive algorithm for trees of arbitrary (fixed) depth. The algorithm works for arbitrary waiting cost functions, including the variant with deadlines.

1 April 2022 in Applied Mathematical Modelling
Verified
Journal Article
Closed access
FDFanny Dufossé
Fanny Dufossé
CDChristoph Dürr
Christoph Dürr
NNNoël Nadal
Noël Nadal
DTDenis Trystram
Denis Trystram
ÓVÓscar C. Vásquez
Óscar C. Vásquez