An improved algorithm for the $$(n, 3)$$ ( n , 3 ) -MaxSAT problem: asking branchings to satisfy the clauses Academic Article