6 citations · 6 across the 1 of their papers we have counts for
2 papers
cs.DS2018
Subset Sum Made Simple
Konstantinos Koiliaris, Chao Xu
Subset Sum is a classical optimization problem taught to undergraduates as an example of an NP-hard problem, which is amenable to dynamic programming, yielding polynomial running t…
cs.DS2015★ 6 cited
Multisection in the Stochastic Block Model using Semidefinite Programming
Naman Agarwal, Afonso S. Bandeira, Konstantinos Koiliaris +1
We consider the problem of identifying underlying community-like structures in graphs. Towards this end we study the Stochastic Block Model (SBM) on -clusters: a random model on…