Zobrazeno 1 - 4
of 4
pro vyhledávání: '"GRAPH PARTITIONING (GRAPH THEORY)"'
Publikováno v:
Proceedings of the IEEE Information Theory Workshop (ITW 2015)
MAXCUT defines a classical NP-hard problem for graph partitioning and it serves as a typical case of the symmetric non-monotone Unconstrained Submodular Maximization (USM) problem. Applications of MAXCUT are abundant in machine learning, computer vis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::af8a5cc7409485fdf25fc272dac9ee4b
https://doi.org/10.1109/itw.2015.7133122
https://doi.org/10.1109/itw.2015.7133122
Publikováno v:
Technical Report / ETH Zurich, Department of Computer Science, 731 (b)
We study the solution quality for min-cut problems on graphs when restricting the shapes of the allowed cuts. In particular we are interested in min-cut problems with additional size constraints on the parts being cut out from the graph. Such problem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e8e40e84b9e7492f017adb3e4787ea37
https://hdl.handle.net/20.500.11850/71724
https://hdl.handle.net/20.500.11850/71724
