A combinatorial design approach to MAXCUT

Authors:
Thomas Hofmeister;Hanno Lefmann
Affiliations:
-;-
Venue:
Proceedings of the seventh international conference on Random structures and algorithms
Year:
1996

Citing 0
Cited 3

Sparse Parity-Check Matrices over ${GF(q)}$

Combinatorics, Probability and Computing
A construction method for optimally universal hash families and its consequences for the existence of RBIBDs

Theoretical Computer Science - Computing and combinatorics
Max-cut parameterized above the edwards-erdős bound

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract