34 citations · 112 across the 16 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
math.OC2016
Improvable Knapsack Problems
Marc Goerigk, Yogish Sabharwal, Anita Schöbel +1
We consider a variant of the knapsack problem, where items are available with different possible weights. Using a separate budget for these item improvements, the question is: Whic…
cs.DC2016★ 10 cited
Subgraph Counting: Color Coding Beyond Trees
Venkatesan T. Chakaravarthy, Michael Kapralov, Prakash Murali +4
The problem of counting occurrences of query graphs in a large data graph, known as subgraph counting, is fundamental to several domains such as genomics and social network analysi…