Thore Husfeldt

News

New paper on subset convolution

Joint work with Björklund, Kaski, and Koivisto on how to compute general subset convolutions faster than by dynamic programming. Especially, it gives a fast algorithm for the minimum Steiner tree problem. Update: To appear at STOC.

Fri, 16 Feb 2007 | Category: News | Permanent link