6 citations · 9 across the 3 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2018★ 2 cited
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…
cs.DS2015★ 1 cited
A Faster Pseudopolynomial Time Algorithm for Subset Sum
Konstantinos Koiliaris, Chao Xu
Given a multiset of positive integers and a target integer , the subset sum problem is to decide if there is a subset of that sums up to . We present a new divide…