Greedy Differencing Edge-Contraction heuristic for the Max-Cut problem
Year of publication: |
2021
|
---|---|
Authors: | Hassin, Refael ; Leshenko, Nikita |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 49.2021, 3, p. 320-325
|
Subject: | Differencing method | Edge contraction | Max cut | Theorie | Theory | Heuristik | Heuristics | Mathematische Optimierung | Mathematical programming |
-
Approximating max-cut under graph-MSO constraints
Koutecký, Martin, (2018)
-
Mirka, Renee, (2024)
-
Scheduling commercial advertisements for television
García-Villoria, Alberto, (2015)
- More ...
-
On Shortest Paths in Graphs with Random Weights
Hassin, Refael, (1984)
-
Probabilistic Analysis of the Capacitated Transportation Problem
Hassin, Refael, (1985)
-
To queue or not to queue : equilibrium behavior in queueing systems
Hassin, Refael, (2003)
- More ...