Parameterized Algorithms
Marek Cygan
Sold by buchversandmimpf2000, Emtmannsberg, BAYE, Germany
AbeBooks Seller since 23 January 2017
New - Hardcover
Condition: New
Quantity: 2 available
Add to basketSold by buchversandmimpf2000, Emtmannsberg, BAYE, Germany
AbeBooks Seller since 23 January 2017
Condition: New
Quantity: 2 available
Add to basketNeuware -This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. The book covers many of the recent developments of the field, including application of important separators, branching based on linear programming, Cut & Count to obtain faster algorithms on tree decompositions, algorithms based on representative families of matroids, and use of the Strong Exponential Time Hypothesis. A number of older results are revisited and explained in a modern and didactic way.The book provides a toolbox of algorithmic techniques. Part I is an overview of basic techniques, each chapter discussing a certain algorithmic paradigm. The material covered in this part can be used for an introductory course on fixed-parameter tractability. Part II discusses more advanced and specialized algorithmic ideas, bringing the reader to the cutting edge of current research. Part III presentscomplexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds.All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students. Every chapter is accompanied by exercises, many with hints, while the bibliographic notes point to original publications and related work.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 632 pp. Englisch.
Seller Inventory # 9783319212746
This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. The book covers many of the recent developments of the field, including application of important separators, branching based on linear programming, Cut & Count to obtain faster algorithms on tree decompositions, algorithms based on representative families of matroids, and use of the Strong Exponential Time Hypothesis. A number of older results are revisited and explained in a modern and didactic way.
The book provides a toolbox of algorithmic techniques. Part I is an overview of basic techniques, each chapter discussing a certain algorithmic paradigm. The material covered in this part can be used for an introductory course on fixed-parameter tractability. Part II discusses more advanced and specialized algorithmic ideas, bringing the reader to the cutting edge of current research. Part III presentscomplexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds.
All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students. Every chapter is accompanied by exercises, many with hints, while the bibliographic notes point to original publications and related work.
Dr. Marek Cygan is an assistant professor at the Institute of Informatics of the University of Warsaw, Poland. His research areas include fixed parameter tractability, approximation algorithms, and exact exponential algorithms.
Prof. Fedor V. Fomin is a professor of algorithms in the Dept. of Informatics of the University of Bergen, Norway. His research interests are largely in the areas of algorithms and combinatorics, in particular: parameterized complexity, algorithms, and kernelization; exact (exponential time) algorithms; graph algorithms, in particular algorithmic graph minors; graph coloring and different modifications; graph widths parameters (treewidth, branchwidth, clique-width, etc.); and pursuit-evasion and search problems.
Dr. Hab. Łukasz Kowalik is an associate professor at the Institute of Informatics of the University of Warsaw, Poland. His research areas include algorithms and graph theory, in particular approximation algorithms, exact algorithms for NP-hard problems, planar graphs, and graph coloring.
Dr. Daniel Lokshtanov is a junior faculty member of the Dept. of Informatics of the University of Bergen, Norway. His research focuses on algorithmic graph theory, and he is the project leader for BeHard, a research project on kernelization.
Dr. Dániel Marx is a senior research fellow at the Institute for Computer Science and Control (SZTAKI) of the Hungarian Academy of Sciences, Budapest, Hungary. His research areas include discrete algorithms, parameterized complexity, and graph theory.
Dr. Marcin Pilipczuk is a postdoctoral researcher at the Institute of Informatics of the University of Warsaw, Poland. His research focuses on algorithmics, especially fixed parameter tractability and exact computations of NP-hard problems.
Dr. Michał Pilipczuk is a postdoctoral researcher at the Institute of Informatics of the University of Warsaw, Poland. His research areas include parameterized complexity, moderately exponential-time algorithms, and kernelization.
Prof. Saket Saurabh is a member of the Theoretical Computer Science (TCS) group of The Institute of Mathematical Sciences (CIT Campus) in Chennai, India. His research interests include algorithms and graph theory, in particular, parameterized and exact algorithms.
"About this title" may belong to another edition of this title.
Widerrufsbelehrung/ Muster-Widerrufsformular/
Allgemeine Geschäftsbedingungen und Kundeninformationen/ Datenschutzerklärung
Widerrufsrecht für Verbraucher
(Verbraucher ist jede natürliche Person, die ein Rechtsgeschäft zu Zwecken abschließt, die überwiegend weder ihrer gewerblichen noch ihrer selbstständigen beruflichen Tätigkeit zugerechnet werden können.)
Widerrufsbelehrung
Widerrufsrecht
Sie haben das Recht, binnen 14 Tagen ohne Angabe von Gründen diesen Vertrag zu widerrufen.
Die Widerrufsfr...
If you are a consumer you can cancel the contract in accordance with the following. Consumer means any natural person who is acting for purposes which are outside his trade, business, craft or profession.
INFORMATION REGARDING THE RIGHT OF CANCELLATION
Statutory Right to cancel
You have the right to cancel this contract within 14 days without giving any reason.
The cancellation period will expire after 14 days from the day on which you acquire, or a third party other than the carrier and indicated by you acquires, physical possession of the the last good or the last lot or piece.
To exercise the right to cancel, you must inform us, buchversandmimpf2000, Oberölschnitz 16, 95517, Emtmannsberg, BAYE, DEU, DEU 09209-2023188, of your decision to cancel this contract by a clear statement (e.g. a letter sent by post, fax or e-mail). You may use the attached model cancellation form, but it is not obligatory. You can also electronically fill in and submit a clear statement on our website, under "My Purchases" in "My Account". If you use this option, we will communicate to you an acknowledgement of receipt of such a cancellation on a durable medium (e.g. by e-mail) without delay.
To meet the cancellation deadline, it is sufficient for you to send your communication concerning your exercise of the right to cancel before the cancellation period has expired.
Effects of cancellation
If you cancel this contract, we will reimburse to you all payments received from you, including the costs of delivery (except for the supplementary costs arising if you chose a type of delivery other than the least expensive type of standard delivery offered by us).
We may make a deduction from the reimbursement for loss in value of any goods supplied, if the loss is the result of unnecessary handling by you.
We will make the reimbursement without undue delay, and not later than 14 days after the day on which we are informed about your decision to cancel with contract.
We will make the reimbursement using the same means of payment as you used for the initial transaction, unless you have expressly agreed otherwise; in any event, you will not incur any fees as a result of such reimbursement.
We may withhold reimbursement until we have received the goods back or you have supplied evidence of having sent back the goods, whichever is the earliest.
You shall send back the goods or hand them over to us or buchversandmimpf2000, Oberölschnitz 16, 95517, Emtmannsberg, BAYE, DEU, 49 09209-2023188, without undue delay and in any event not later than 14 days from the day on which you communicate your cancellation from this contract to us. The deadline is met if you send back the goods before the period of 14 days has expired. You will have to bear the direct cost of returning the goods. You are only liable for any diminished value of the goods resulting from the handling other than what is necessary to establish the nature, characteristics and functioning of the goods.
Exceptions to the right of cancellation
The right of cancellation does not apply to:
Model withdrawal form
(complete and return this form only if you wish to withdraw from the contract)
To: (buchversandmimpf2000, Oberölschnitz 16, 95517, Emtmannsberg, BAYE, Germany, 49 09209-2023188)
I/We (*) hereby give notice that I/We (*) withdraw from my/our (*) contract of sale of the following goods (*)/for the provision of the following goods (*)/for the provision of the following service (*),
Ordered on (*)/received on (*)
Name of consumer(s)
Address of consumer(s)
Signature of consumer(s) (only if this form is notified on paper)
Date
* Delete as appropriate.
Soweit in der Artikelbeschreibung keine andere Frist angegeben ist, erfolgt die Lieferung der Ware innerhalb von 3-5 Werktagen nach Vertragsschluss, bei Vorauszahlung erst nach Eingang des vollständigen Kaufpreises und der Versandkosten. Alle Preise inkl. MwSt.
| Order quantity | 60 to 60 business days | 60 to 60 business days |
|---|---|---|
| First item | £ 52.85 | £ 66.07 |
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.