Filters








4 Hits in 7.2 sec

Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism [article]

Eunjung Kim and Christophe Paul and Ignasi Sau and Dimitrios M. Thilikos
2015 arXiv   pre-print
We also prove that Min-Max Multiway Cut can be solved in time 2^O((ℓ r)^2ℓ r)· n^4· n.  ...  The first is List Digraph Homomorphism: given two digraphs G and H and a list of allowed vertices of H for every vertex of G, the question is whether there exists a homomorphism from G to H respecting  ...  We would like to thank the anonymous referees of an earlier version of this paper for their thorough remarks and suggestions that improved the presentation and some proofs of the paper.  ... 
arXiv:1509.07404v1 fatcat:4btjlhycejf6tlqfxm45k4bdpu

Parameterized algorithms for min-max multiway cut and list digraph homomorphism

Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
2017 Journal of computer and system sciences (Print)  
The first is List Digraph Homomorphism: given two digraphs G and H and a list of allowed vertices of H for every vertex of G, the question is whether there exists a homomorphism from G to H respecting  ...  We also prove that Min-Max Multiway Cut can be solved in time 2 O(( r) 2 log r) · n 4 · log n.  ...  We would like to thank the anonymous referees of an earlier version of this paper for their thorough remarks and suggestions that improved the presentation and some proofs of the paper.  ... 
doi:10.1016/j.jcss.2017.01.003 fatcat:2q2accwudrehlg4jt2wwxkb7sq

14th International Symposium on Mathematical Programming

1990 Mathematical programming  
It is shown that for the success of the variant dom must ful ll a regularity property and that the choice of the normal vectors must meet some demands.Both requirements are ful lled if dom is polyhedral  ...  Finally I report numerical results of a comparison between the variant and a minimization approach using penalty functions.  ...  results polynomial-time algorithms, totally dual integral polyhedral descriptions, min-max theorems for the two special cases.  ... 
doi:10.1007/bf01580875 fatcat:3jtclwmntzgjxkqs5uecombdaa

OASIcs, Volume 69, SOSA'19, Complete Volume [article]

Jeremy T. Fineman, Michael Mitzenmacher
2019
Acknowledgements We thank Dipen Rughwani, Kostas Tsioutsiouliklis, and Yunhong Zhou for telling us about [18], for extensive discussions about the problem and our algorithms, and for insightful comments  ...  Acknowledgements We thank Manfred Scheucher for implementing the algorithm and helping with the figures.  ...  Such problems include classics such as max cut, min cut, maximum coverage, and minimum spanning tree [6] .  ... 
doi:10.4230/oasics.sosa.2019 fatcat:qjz3tl5ccfe3nprcrv6msbfwbq