125 citations
- Samsung (United States)US21 papers
- Yahoo (United States)US9 papers
- Arizona State UniversityUS2 papers
- Data61AU2 papers
- Duke UniversityUS2 papers
- Northwestern UniversityUS2 papers
- Stanford UniversityUS2 papers
- The Ohio State UniversityUS2 papers
- University of California, BerkeleyUS2 papers
- University of Illinois Urbana-ChampaignUS2 papers
- University of Technology SydneyAU2 papers
- Albany State UniversityUS1 paper
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2018★ 6 cited
LP Relaxation and Tree Packing for Minimum -cuts
Chandra Chekuri, Kent Quanrud, Chao Xu
Karger used spanning tree packings to derive a near linear-time randomized algorithm for the global minimum cut problem as well as a bound on the number of approximate minimum cuts…
cs.DS2014★ 4 cited
New Techniques and Tighter Bounds for Local Computation Algorithms
Omer Reingold, Shai Vardi
Given an input , and a search problem , local computation algorithms (LCAs) implement access to specified locations of in a legal output , using polylogarithm…