Guy Kindler Weizmann Institute. Well try to understand some notions, and their relations: Combinatorial optimization problems Combinatorial optimization.
Local Weight Distribution of the (256, 93) Third-Order Binary Reed-Muller Code Kenji Yasunaga (Osaka Univ.) Toru Fujiwara (Osaka Univ.) Tadao Kasami (NAIST)
Understanding the Power of Convex Relaxation Hierarchies: Effectiveness and Limitations Yuan Zhou Computer Science Department Carnegie Mellon University.
(Algorithms in Bipartite Graphs). Introduction Algorithms in unweighted bipartite graph (Yehong & Gordon) Maximum matching A simple algorithm Hopcroft-Karp.
Covering Trains by Stations or The power of Data Reduction Karsten Weihe, ALEX98, 1998 Presented by Yantao Song.
Understanding the Power of Convex Relaxation Hierarchies: Effectiveness and Limitations
results from
Covering Trains by Stations or The power of Data Reduction
