53 citations · 158 across the 16 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.LO2018
Approximation Strategies for Incomplete MaxSAT
Saurabh Joshi, Prateek Kumar, Ruben Martins +1
Incomplete MaxSAT solving aims to quickly find a solution that attempts to minimize the sum of the weights of the unsatisfied soft clauses without providing any optimality guarante…
cs.DS2018★ 1 cited
On the Tractability of (k,i)-Coloring
Sriram Bhyravarapu, Saurabh Joshi, Subrahmanyam Kalyanasundaram +1
In an undirected graph, a proper (k,i)-coloring is an assignment of a set of k colors to each vertex such that any two adjacent vertices have at most i common colors. The (k,i)-col…