Constant-factor approximation algorithms for parity-constrained facility location and k-center
K Kim, Y Shin, HC An - Algorithmica, 2023 - Springer
Facility location is a prominent optimization problem that has inspired a large quantity of
both theoretical and practical studies in combinatorial optimization. Although the problem …
both theoretical and practical studies in combinatorial optimization. Although the problem …
Detecting symmetries by branch & cut
C Buchheim, M Jünger - Mathematical programming, 2003 - Springer
The NP-hard problem of finding symmetries in an abstract graph plays an important role in
automatic graph drawing and other applications. In this paper, we present an exact …
automatic graph drawing and other applications. In this paper, we present an exact …
Constant-Factor approximation algorithms for parity-constrained facility location problems
K Kim, Y Shin, HC An - arXiv preprint arXiv:1907.03129, 2019 - arxiv.org
Facility location is a prominent optimization problem that has inspired a large quantity of
both theoretical and practical studies in combinatorial optimization. Although the problem …
both theoretical and practical studies in combinatorial optimization. Although the problem …
Single commodity flow algorithms for lifts of graphic and cographic matroids
L Stuive - 2013 - uwspace.uwaterloo.ca
Consider a binary matroid M given by its matrix representation. We show that if M is a lift of a
graphic or a cographic matroid, then in polynomial time we can either solve the single …
graphic or a cographic matroid, then in polynomial time we can either solve the single …