Skip to content

Author

A. Y. Shavit

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

A minimum witness for the 3/2 configuration-linear-program gap in two-weight graph balancing, unique at its size

In restricted assignment - makespan minimization where each job has one size and a set of allowed machines - the configuration LP is the tightest studied relaxation, and its integrality gap is open in general. On two-weight graph balancing - each job allowed on at most two machines, sizes from two values - the value is...

A. Y. Shavit · 2 citations
Preprint Sep 2026

Minimum-makespan completion and vertex selection leave the Wang-Sitters constant at 11/6

The 11/6 worst-case constant of the Wang-Sitters rounding scheme, which a companion note establishes, can naturally be attributed to the freedom in Step 3, where an arbitrary valid slot matching is permitted. We show that eliminating that freedom does not improve the constant. A minimum-makespan completion oracle still...

A. Y. Shavit · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.