MAX CUT in weighted random intersection graphs and discrepancy of sparse random set systems
From MaRDI portal
Publication:6053474
DOI10.1007/s00453-023-01121-3arXiv2009.01567OpenAlexW3217310117MaRDI QIDQ6053474
Christoforos L. Raptopoulos, Sotiris E. Nikoletseas, Paul G. Spirakis
Publication date: 27 September 2023
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.01567
Cites Work
- Unnamed Item
- On the absolute constants in the Berry-Esseen-type inequalities
- Optimization, approximation, and complexity classes
- An extension of the Moran process using type-specific connection graphs
- Data science, learning by latent structures, and knowledge discovery.
- Extremal cuts of sparse random graphs
- Equivalence of a random intersection graph and G (n ,p )
- Selected Combinatorial Properties of Random Intersection Graphs
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- On Random Intersection Graphs: The Subgraph Problem
- On the max‐cut of sparse random graphs
- On the total variation distance between the binomial random graph and the random intersection graph
- On the Beck-Fiala Conjecture for Random Set Systems
- Random MAX SAT, random MAX CUT, and their phase transitions
- Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
- Coloring Random Intersection Graphs and Complex Networks
- A Fourier-Analytic Approach for the Discrepancy of Random Set Systems
- On the discrepancy of random low degree set systems
- MAX k‐CUT and approximating the chromatic number of random graphs
- Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
- Algorithms and Computation
- The discrepancy of random rectangular matrices
This page was built for publication: MAX CUT in weighted random intersection graphs and discrepancy of sparse random set systems
