"Fast Balanced Partitioning Is Hard Even on Grids and Trees."

Andreas Emil Feldmann (2012)

Details and statistics

DOI: 10.1007/978-3-642-32589-2_34

access: closed

type: Conference or Workshop Paper

metadata version: 2017-06-15

a service of  Schloss Dagstuhl - Leibniz Center for Informatics