Skip to content

The complexity of approximating averages on bounded-degree graphs.

Andreas Galanis, Daniel Stefankovic, Eric Vigoda

VenueA*FOCS
Year2020
ProceedingsFOCS

Browse the full FOCS paper archive.