scientific article; zbMATH DE number 1956210
From MaRDI portal
Publication:4417671
zbMath1026.68773MaRDI QIDQ4417671
Publication date: 29 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2547/25470051.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Computing methodologies and applications (68U99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25)
Related Items
Moving policies in cyclic assembly line scheduling, A parameterized perspective on packing paths of length two, Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU, Book review of: Rolf Niedermeier, Invitation to fixed-parameter algorithms, Confronting intractability via parameters, Sources of complexity in subset choice, The complexity ecology of parameters: An illustration using bounded max leaf number, Efficiency in exponential time for domination-type problems
