Reproducibility report for ACM SIGMOD 2024 paper

This report evaluates the reproducibility of the paper titled “Faster Algorithms for Fair Max-Min Diversification in 𝑅𝑑 ”. The paper’s artifacts were available and evaluatable. Reproducibility was straightforward. The paper’s core claims were reproduced, with minor variations in a few graphs.

Authors

Publication Details

Journal
DepositOnce
Published
2025-03-24
DOI
https://doi.org/10.14279/depositonce-24509
Primary Topic
Complexity and Algorithms in Graphs
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Reproducibility report for ACM SIGMOD 2024 paper

Lukas Schwerdtfeger, William Zhang
DepositOnce
Complexity and Algorithms in Graphs
article

Reproducibility report for ACM SIGMOD 2024 paper

Lukas Schwerdtfeger, William Zhang
article en

Abstract

This report evaluates the reproducibility of the paper titled “Faster Algorithms for Fair Max-Min Diversification in 𝑅𝑑 ”. The paper’s artifacts were available and evaluatable. Reproducibility was straightforward. The paper’s core claims were reproduced, with minor variations in a few graphs.

DepositOnce
Openalex Percentile: Top 24%
Complexity and Algorithms in Graphs
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Reproducibility report for ACM SIGMOD 2024 paper — Lukas Schwerdtfeger, William Zhang · DepositOnce (2025) | TGRS Research Map | TGRS