activity
20112026
most citedA -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs

23 citations · 66 across the 21 of their papers we have counts for

collaborators
Showing 2011 · cs.CCShow all

1 paper · 2 filters

cs.CC2011

Fast Balanced Partitioning is Hard, Even on Grids and Trees

Andreas Emil Feldmann

Two kinds of approximation algorithms exist for the k-BALANCED PARTITIONING problem: those that are fast but compute unsatisfying approximation ratios, and those that guarantee hig…