T
Thore Husfeldt
Researcher at IT University of Copenhagen
Publications - 87
Citations - 3172
Thore Husfeldt is an academic researcher from IT University of Copenhagen. The author has contributed to research in topics: Cell-probe model & Upper and lower bounds. The author has an hindex of 25, co-authored 87 publications receiving 2971 citations. Previous affiliations of Thore Husfeldt include University of Copenhagen & Aalto University.
Papers
More filters
Journal ArticleDOI
Set Partitioning via Inclusion-Exclusion
TL;DR: In this article, the authors proposed a polynomial space approximation algorithm for the problem of finding a number between a set of elements and a family of subsets in time O(1.2209^n+2.8718^n) using the zeta transform.
Proceedings Article
Set partitioning via inclusion-exclusion
TL;DR: The algorithms are based on the principle of inclusion-exclusion and the zeta transform and get exact algorithms in time for several well-studied partition problems including domatic number, chromaticNumber, maximum $k$-cut, bin packing, list coloring, and the chromatic polynomial.
Posted Content
Fourier meets Möbius: fast subset convolution
TL;DR: Koivisto et al. as discussed by the authors presented an O(2k n2 + n m) algorithm for the Steiner tree problem in graphs with n vertices, k terminals, and m edges with bounded integer weights.
Proceedings ArticleDOI
Fourier meets möbius: fast subset convolution
TL;DR: The first Õ(2k2 + n m) algorithm for the Steiner tree problem in graphs with vertices, terminals, and edges with bounded integer weights is presented, improving upon the classical Dreyfus-Wagner algorithm.
Proceedings ArticleDOI
Marked ancestor problems
TL;DR: The upper bounds improve algorithms from various fields, including coloured ancestor problems and maintenance of balanced parentheses and several problems from dynamic computational geometry, including segment intersection, interval maintenance, and ray shooting in the plane.