Maximum-entropy relaxation yields an iterative local-minimization algorithm for static multiway k-cuts and a control-Lyapunov design that keeps the cut value small under edge-weight dynamics.
A lyapunov-like characterization of asymptotic control- lability,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Multiway k-Cut in Static and Dynamic Graphs: A Maximum Entropy Principle Approach
Maximum-entropy relaxation yields an iterative local-minimization algorithm for static multiway k-cuts and a control-Lyapunov design that keeps the cut value small under edge-weight dynamics.