64 lines
1.8 KiB
BibTeX
64 lines
1.8 KiB
BibTeX
@article{cunningham_optimal_1985,
|
|
title = {Optimal attack and reinforcement of a network},
|
|
volume = {32},
|
|
issn = {0004-5411, 1557-735X},
|
|
url = {https://dl.acm.org/doi/10.1145/3828.3829},
|
|
doi = {10.1145/3828.3829},
|
|
language = {en},
|
|
number = {3},
|
|
urldate = {2025-04-11},
|
|
journal = {Journal of the ACM},
|
|
author = {Cunningham, William H.},
|
|
month = jul,
|
|
year = {1985},
|
|
pages = {549--561},
|
|
}
|
|
|
|
|
|
@article{chekuri_lp_2020,
|
|
title = {{LP} {Relaxation} and {Tree} {Packing} for {Minimum} $k$-{Cut}},
|
|
volume = {34},
|
|
issn = {0895-4801, 1095-7146},
|
|
url = {https://epubs.siam.org/doi/10.1137/19M1299359},
|
|
doi = {10.1137/19M1299359},
|
|
language = {en},
|
|
number = {2},
|
|
urldate = {2022-04-10},
|
|
journal = {SIAM Journal on Discrete Mathematics},
|
|
author = {Chekuri, Chandra and Quanrud, Kent and Xu, Chao},
|
|
month = jan,
|
|
year = {2020},
|
|
keywords = {Approximation, K-cut, Minimum cut, Tree packing},
|
|
pages = {1334--1353},
|
|
}
|
|
|
|
@article{Thorup2008,
|
|
title = {Minimum k-way cuts via deterministic greedy tree packing},
|
|
issn = {07378017},
|
|
url = {http://dl.acm.org/citation.cfm?id=1374402},
|
|
doi = {10.1145/1374376.1374402},
|
|
journal = {Proceedings of the 40th annual ACM symposium on …},
|
|
author = {Thorup, Mikkel},
|
|
year = {2008},
|
|
note = {ISBN: 9781605580470},
|
|
keywords = {k-way cuts, tree packing},
|
|
pages = {159--165},
|
|
}
|
|
|
|
@article{thorup_fully-dynamic_2007,
|
|
title = {Fully-{Dynamic} {Min}-{Cut}*},
|
|
volume = {27},
|
|
issn = {0209-9683, 1439-6912},
|
|
url = {http://link.springer.com/10.1007/s00493-007-0045-2},
|
|
doi = {10.1007/s00493-007-0045-2},
|
|
language = {en},
|
|
number = {1},
|
|
urldate = {2023-02-05},
|
|
journal = {Combinatorica},
|
|
author = {Thorup, Mikkel},
|
|
month = feb,
|
|
year = {2007},
|
|
pages = {91--127},
|
|
file = {Thorup_2007_Fully-Dynamic Min-Cut.pdf:/Users/congyu/Zotero/storage/Q329VHH3/Thorup_2007_Fully-Dynamic Min-Cut.pdf:application/pdf},
|
|
}
|