Reproduce “Some complexity and approximation results for coupled-tasks scheduling problem according to topology” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Benoit Darties, Rodolphe Giroudeau, Jean-Claude König, Gilles Simonin

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.