Wenkai Dai

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 10

Top Topics

Network Topologies

Top Venues

SIGMETRICS Perform. Evaluation Rev.

J. Comb. Optim.

Publications

Wenkai Dai, Michael Dinitz, Klaus-Tycho Foerster, Long Luo, Stefan Schmid
Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks. CoRR (2024)
Wenkai Dai, Michael Dinitz, Klaus-Tycho Foerster, Long Luo, Stefan Schmid
Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks. INFOCOM (2024)
Wenkai Dai, Klaus-Tycho Foerster, David Fuchssteiner, Stefan Schmid
Load-optimization in Reconfigurable Data-center Networks: Algorithms and Complexity of Flow Routing. ACM Trans. Model. Perform. Evaluation Comput. Syst. 8 (3) (2023)
Wenkai Dai, Klaus-Tycho Foerster, Stefan Schmid
A Tight Characterization of Fast Failover Routing: Resiliency to Two Link Failures is Possible. SPAA (2023)
Wenkai Dai, Michael Dinitz, Klaus-Tycho Foerster, Stefan Schmid
Brief Announcement: Minimizing Congestion in Hybrid Demand-Aware Network Topologies. DISC (2022)
Maciej Pacut, Wenkai Dai, Alexandre Labbe, Klaus-Tycho Foerster, Stefan Schmid
Improved Scalability of Demand-Aware Datacenter Topologies With Minimal Route Lengths and Congestion. SIGMETRICS Perform. Evaluation Rev. 49 (3) (2022)
Maciej Pacut, Wenkai Dai, Alexandre Labbe, Klaus-Tycho Foerster, Stefan Schmid
Improved scalability of demand-aware datacenter topologies with minimal route lengths and congestion. Perform. Evaluation 152 (2021)
Wenkai Dai, Klaus-Tycho Foerster, David Fuchssteiner, Stefan Schmid
Load-Optimization in Reconfigurable Networks: Algorithms and Complexity of Flow Routing. SIGMETRICS Perform. Evaluation Rev. 48 (3) (2020)
Wenkai Dai, Yongjie Yang
Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications. J. Comb. Optim. 37 (2) (2019)
Wenkai Dai
Reoptimization of Minimum Latency Problem. COCOON (2017)
Vorapong Suppakitpaisarn, Wenkai Dai, Jean-François Baffier
Robust network flow against attackers with knowledge of routing method. HPSR (2015)