Approximating max-cut under graph-MSO constraints
Year of publication: |
November 2018
|
---|---|
Authors: | Koutecký, Martin ; Lee, Jon ; Nagarajan, Viswanath ; Shen, Xiangkun |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 46.2018, 6, p. 592-598
|
Subject: | Max cut | Approximation algorithm | Monadic second-order logic | Treewidth | Dynamic program | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Algorithmus | Algorithm | Dynamische Optimierung | Dynamic programming |
-
An approximate dynamic-programming approach to the joint replenishment problem
Segev, Danny, (2014)
-
A multi-phase algorithm for a joint lot-sizing and pricing problem with stochastic demands
Li, Hongyan, (2014)
-
Zhang, Huanan, (2022)
- More ...
-
Stochastic load balancing on unrelated machines
Gupta, Anupam, (2021)
-
A note on the approximability of deepest-descent circuit steps
Borgwardt, Steffen Alexander, (2021)
-
Scheduling meets n-fold integer programming
Knop, Dušan, (2018)
- More ...