Complexity and Approximation of Satisfactory Partition Problems

Lecture Notes in Computer Science - Germany
doi 10.1007/11533719_84
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg