2 citations · 3 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021
Fully-dynamic Weighted Matching Approximation in Practice
Eugenio Angriman, Henning Meyerhenke, Christian Schulz +1
Finding large or heavy matchings in graphs is a ubiquitous combinatorial optimization problem. In this paper, we engineer the first non-trivial implementations for approximating th…
cs.DS2021★ 1 cited
Streaming Hypergraph Partitioning Algorithms on Limited Memory Environments
Fatih Taşyaran, Berkay Demireller, Kamer Kaya +1
Many well-known, real-world problems involve dynamic data which describe the relationship among the entities. Hypergraphs are powerful combinatorial structures that are frequently…