Zobrazeno 1 - 10
of 45
pro vyhledávání: '"ALGORITHMIC COMPLEXITY (MATHEMATICS)"'
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:
Lecture Notes in Computer Science ISBN: 9783319213972
COCOON
COCOON
We study the disjoint path allocation problem. In this setting, a path \(P\) of length \(L\) is given, and a sequence of subpaths of \(P\) arrives online, one in every time step. Each such path requests a permanent connection between its two end-vert
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6104ee854cc78bd0e64b0f4d4d47a49
https://doi.org/10.1007/978-3-319-21398-9_33
https://doi.org/10.1007/978-3-319-21398-9_33
