| Document Date: 2009-10-29 15:21:24
Open Document File Size: 208,62 KBShare Result on Facebook
City Santiago / Bergen / Chennai / / Company Vertex / / Country Norway / France / India / Chile / / / Facility University of Bergen / Institute of Mathematical Sciences / CIT Campus / / IndustryTerm compression algorithm / faster algorithms / exponential time algorithms / basic algorithms / combinatorial algorithms / iterative compression algorithm / given algorithm / prospective solutions / exponential time algorithm / iterative compression algorithms / complicated branching algorithm / polynomialdelay algorithm / inclusion-exclusion algorithms / fixed parameter tractable algorithms / trivial algorithm / / Organization Institute of Mathematical Sciences / Universidad de Chile / Department of Informatics / Research Council of Norway / University of Bergen / / Person Mathieu Liedloff§ Dieter Kratsch / Serge Gaspers† Mathieu Liedloff / Dieter Kratsch‡ Saket Saurabh / Paul Verlaine / / Technology basic algorithms / FPT algorithm / complicated branching algorithm / polynomialdelay algorithm / following algorithm / branching algorithm / FPT algorithms / exponential time algorithms / Typically iterative compression algorithms / fixed parameter tractable algorithms / compression algorithm / given algorithm / time algorithm / trivial algorithm / faster FPT algorithms / S. Our algorithm / inclusion-exclusion algorithms / exponential time algorithm / iterative compression algorithm / /
SocialTag |
Iterative Compression and Exact Algorithms Fedor V. Fomin∗ Serge Gaspers† Mathieu Liedloff§