Zobrazeno 1 - 5
of 5
pro vyhledávání: '"CHUN KONG YUNG"'
Autor:
Lap Chi Lau, Chun Kong Yung
Publikováno v:
SIAM Journal on Computing. 42:1185-1200
We present new edge splitting-off results maintaining all-pairs edge-connectivities of an undirected graph. We first give an alternate proof of Mader's theorem, and use it to obtain a deterministic $\tilde{O}(m + {r_{\max}}^2 \cdot n^2)$-time complet
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c70063b962bcd08993eeac238aeebdd6
https://doi.org/10.1137/100790239
https://doi.org/10.1137/100790239
Publikováno v:
FOCS
Given a complete undirected graph, a cost function on edges, and a degree bound $B$, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum degree $B$ satisfying given connectivity requirements. Even for a si
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::07c544d45cdf6e098a15b7fdb7425bba
https://doi.org/10.1137/090746495
https://doi.org/10.1137/090746495
Autor:
Lap Chi Lau, Chun Kong Yung
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783642130359
IPCO
IPCO
In this paper we present new edge splitting-off results maintaining all-pairs edge-connectivities of a graph. We first give an alternate proof of Mader's theorem, and use it to obtain a deterministic $\tilde{O}({r_{\max}}^2 \cdot n^2)$-time complete
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3ec40c084c923dcec7ab730246bcc043
https://doi.org/10.1007/978-3-642-13036-6_8
https://doi.org/10.1007/978-3-642-13036-6_8
Publikováno v:
SIAM Journal on Computing; 2011, Vol. 40 Issue 4, p953-980, 28p
Autor:
Friedrich Eisenbrand, Bruce Shepherd
Theidea ofa refereedconferencefor the mathematicalprogrammingcommunity was proposed by Ravi Kannan and William Pulleyblank to the Mathematical Programming Society (MPS) in the late 1980s. Thus IPCO was born, and MPS has sponsored the conference as on