Invitation to Fixed-Parameter Algorithms
Rolf Niedermeier
ፌብ 2006 · Oxford Lecture Series in Mathematics and Its Applications መጽሐፍ 31 · OUP Oxford
ኢ-መጽሐፍ
316
ገጾች
family_home
ብቁ
info
reportየተሰጡት ደረጃዎች እና ግምገማዎች የተረጋገጡ አይደሉም የበለጠ ለመረዳት
ስለዚህ ኢ-መጽሐፍ
This research-level text is an application-oriented introduction to the growing and highly topical area of the development and analysis of efficient fixed-parameter algorithms for optimally solving computationally hard combinatorial problems. The book is divided into three parts: a broad introduction that provides the general philosophy and motivation; followed by coverage of algorithmic methods developed over the years in fixed-parameter algorithmics forming the core of the book; and a discussion of the essentials from parameterized hardness theory with a focus on W[1]-hardness which parallels NP-hardness, then stating some relations to polynomial-time approximation algorithms, and finishing up with a list of selected case studies to show the wide range of applicability of the presented methodology. Aimed at graduate and research mathematicians, programmers, algorithm designers, and computer scientists, the book introduces the basic techniques and results and provides a fresh view on this highly innovative field of algorithmic research.
ለዚህ ኢ-መጽሐፍ ደረጃ ይስጡ
ምን እንደሚያስቡ ይንገሩን።
የንባብ መረጃ
ዘመናዊ ስልኮች እና ጡባዊዎች
የGoogle Play መጽሐፍት መተግበሪያውን ለAndroid እና iPad/iPhone ያውርዱ። ከእርስዎ መለያ ጋር በራስሰር ይመሳሰላል እና ባሉበት የትም ቦታ በመስመር ላይ እና ከመስመር ውጭ እንዲያነቡ ያስችልዎታል።
ላፕቶፖች እና ኮምፒውተሮች
የኮምፒውተርዎን ድር አሳሽ ተጠቅመው በGoogle Play ላይ የተገዙ ኦዲዮ መጽሐፍትን ማዳመጥ ይችላሉ።
ኢሪደሮች እና ሌሎች መሳሪያዎች
እንደ Kobo ኢ-አንባቢዎች ባሉ ኢ-ቀለም መሣሪያዎች ላይ ለማንበብ ፋይል አውርደው ወደ መሣሪያዎ ማስተላለፍ ይኖርብዎታል። ፋይሎቹን ወደሚደገፉ ኢ-አንባቢዎች ለማስተላለፍ ዝርዝር የእገዛ ማዕከል መመሪያዎቹን ይከተሉ።
