ACM Symposium on Discrete Algorithms, SODA 2017


Article Details
Title: Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion
Article URLs:
Alternative Article URLs:
Authors: Eden Chlamtác
  • Ben-Gurion University of the Negev
Michael Dinitz
  • Johns Hopkins University
Yury Makarychev
  • Toyota Technological Institute at Chicago
Sharing: Research produced no artifacts
Verification: Authors have verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1464239, 1535887, 1150062, 1302662
DBLP Key: conf/soda/ChlamtacDM17
Author Comments:

Discuss this paper and its artifacts below