Released on 2008-08-06Categories Computers

Encyclopedia of Algorithms

Encyclopedia of Algorithms

Author: Ming-Yang Kao

Publisher: Springer Science & Business Media

ISBN: 9780387307701

Category: Computers

Page: 1166

View: 534

One of Springer’s renowned Major Reference Works, this awesome achievement provides a comprehensive set of solutions to important algorithmic problems for students and researchers interested in quickly locating useful information. This first edition of the reference focuses on high-impact solutions from the most recent decade, while later editions will widen the scope of the work. All entries have been written by experts, while links to Internet sites that outline their research work are provided. The entries have all been peer-reviewed. This defining reference is published both in print and on line.
Released on 2020-04-20Categories Computers

Treewidth, Kernels, and Algorithms

Treewidth, Kernels, and Algorithms

Author: Fedor V. Fomin

Publisher: Springer Nature

ISBN: 9783030420710

Category: Computers

Page: 299

View: 488

This Festschrift was published in honor of Hans L. Bodlaender on the occasion of his 60th birthday. The 14 full and 5 short contributions included in this volume show the many transformative discoveries made by H.L. Bodlaender in the areas of graph algorithms, parameterized complexity, kernelization and combinatorial games. The papers are written by his former Ph.D. students and colleagues as well as by his former Ph.D. advisor, Jan van Leeuwen.
Released on 2021-07-30Categories Computers

Algorithms and Data Structures

Algorithms and Data Structures

Author: Anna Lubiw

Publisher: Springer Nature

ISBN: 9783030835088

Category: Computers

Page: 670

View: 395

This book constitutes the refereed proceedings of the 17th International Symposium on Algorithms and Data Structures, WADS 2021, held in virtually in August 2021. The 47 full papers, presented together with two invited lectures, were carefully reviewed and selected from a total of 123 submissions. They present original research on the theory, design and application of algorithms and data structures.
Released on 2010-10-26Categories Mathematics

Exact Exponential Algorithms

Exact Exponential Algorithms

Author: Fedor V. Fomin

Publisher: Springer Science & Business Media

ISBN: 9783642165337

Category: Mathematics

Page: 206

View: 261

For a long time computer scientists have distinguished between fast and slow algo rithms. Fast (or good) algorithms are the algorithms that run in polynomial time, which means that the number of steps required for the algorithm to solve a problem is bounded by some polynomial in the length of the input. All other algorithms are slow (or bad). The running time of slow algorithms is usually exponential. This book is about bad algorithms. There are several reasons why we are interested in exponential time algorithms. Most of us believe that there are many natural problems which cannot be solved by polynomial time algorithms. The most famous and oldest family of hard problems is the family of NP complete problems. Most likely there are no polynomial time al gorithms solving these hard problems and in the worst case scenario the exponential running time is unavoidable. Every combinatorial problem is solvable in ?nite time by enumerating all possi ble solutions, i. e. by brute force search. But is brute force search always unavoid able? De?nitely not. Already in the nineteen sixties and seventies it was known that some NP complete problems can be solved signi?cantly faster than by brute force search. Three classic examples are the following algorithms for the TRAVELLING SALESMAN problem, MAXIMUM INDEPENDENT SET, and COLORING.
Released on 2015-07-27Categories Computers

Algorithms and Data Structures

Algorithms and Data Structures

Author: Frank Dehne

Publisher: Springer

ISBN: 9783319218403

Category: Computers

Page: 646

View: 326

This book constitutes the refereed proceedings of the 14th Algorithms and Data Structures Symposium, WADS 2015, held in Victoria, BC, Canada, August 2015. The 54 revised full papers presented in this volume were carefully reviewed and selected from 148 submissions. The Algorithms and Data Structures Symposium - WADS (formerly Workshop on Algorithms And Data Structures), which alternates with the Scandinavian Workshop on Algorithm Theory, is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. WADS includes papers presenting original research on algorithms and data structures in all areas, including bioinformatics, combinatorics, computational geometry, databases, graphics, and parallel and distributed computing.
Released on 2010-08-30Categories Computers

Algorithms - ESA 2010

Algorithms - ESA 2010

Author: Mark de Berg

Publisher: Springer Science & Business Media

ISBN: 9783642157745

Category: Computers

Page: 587

View: 164

This book constitutes the proceedings of the 18th Annual European Symposium on Algorithms, held in Liverpool, UK in September 2010.
Released on 2019-11-14Categories Computers

Analysis of Experimental Algorithms

Analysis of Experimental Algorithms

Author: Ilias Kotsireas

Publisher: Springer Nature

ISBN: 9783030340292

Category: Computers

Page: 564

View: 280

This book constitutes the refereed post-conference proceedings of the Special Event on the Analysis of Experimental Algorithms, SEA2 2019, held in Kalamata, Greece, in June 2019. The 35 revised full papers presented were carefully reviewed and selected from 45 submissions. The papers cover a wide range of topics in both computer science and operations research/mathematical programming. They focus on the role of experimentation and engineering techniques in the design and evaluation of algorithms, data structures, and computational optimization methods.
Released on 2019-02-20Categories Computers

WALCOM: Algorithms and Computation

WALCOM: Algorithms and Computation

Author: Gautam K. Das

Publisher: Springer

ISBN: 9783030105648

Category: Computers

Page: 420

View: 416

This book constitutes the proceedings of the 13th International Conference and Workshop on Algorithms and Computation, WALCOM 2019, held in Guwahati, India, in February/ March 2019. The 30 full papers presented were carefully reviewed and selected from 100 submissions. The papers are organized in topical headings on the facility location problem; computational geometry; graph drawing; graph algorithms; approximation algorithms; miscellaneous; data structures; parallel and distributed algorithms; and packing and covering.
Released on 2016-01-12Categories Computers

Approximation and Online Algorithms

Approximation and Online Algorithms

Author: Laura Sanità

Publisher: Springer

ISBN: 9783319286846

Category: Computers

Page: 209

View: 665

This book constitutes the thoroughly refereed post-workshop proceedings of the 13th International Workshop on Approximation and Online Algorithms, WAOA 2015, held in Patras, Greece, in September 2015 as part of ALGO 2015. The 17 revised full papers presented were carefully reviewed and selected from 40 submissions. Topics of interest for WAOA 2015 were: algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, geometric problems, graph algorithms, inapproximability, mechanism design, natural algorithms, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, parameterized complexity, scheduling problems,and real-world applications.
Released on 2020-10-31Categories Computers

Algorithms and Data Structures

Algorithms and Data Structures

Author: Helmut Knebl

Publisher: Springer Nature

ISBN: 9783030597580

Category: Computers

Page: 349

View: 873

This is a central topic in any computer science curriculum. To distinguish this textbook from others, the author considers probabilistic methods as being fundamental for the construction of simple and efficient algorithms, and in each chapter at least one problem is solved using a randomized algorithm. Data structures are discussed to the extent needed for the implementation of the algorithms. The specific algorithms examined were chosen because of their wide field of application. This book originates from lectures for undergraduate and graduate students. The text assumes experience in programming algorithms, especially with elementary data structures such as chained lists, queues, and stacks. It also assumes familiarity with mathematical methods, although the author summarizes some basic notations and results from probability theory and related mathematical terminology in the appendices. He includes many examples to explain the individual steps of the algorithms, and he concludes each chapter with numerous exercises.
Released on 2017-02-18Categories Computers

WALCOM: Algorithms and Computation

WALCOM: Algorithms and Computation

Author: Sheung-Hung Poon

Publisher: Springer

ISBN: 9783319539256

Category: Computers

Page: 474

View: 775

This book constitutes the proceedings of the 11th International Workshop on Algorithms and Computation, WALCOM 2017, held in Hsinchu, Taiwan, in March 2017. The 35 full papers presented together with three invited talks were carefully reviewed and selected from 83 submissions. The papers are organized in topical sections on invited talks; computational geometry; combinatorial optimization; graph drawing; graph algorithms; space-efficient algorithms; computational complexity; approximation algorithms.
Released on 2013-03-20Categories Mathematics

Algorithmics of Matching Under Preferences

Algorithmics of Matching Under Preferences

Author: David F Manlove

Publisher: World Scientific

ISBN: 9789814425261

Category: Mathematics

Page: 524

View: 837

Matching problems with preferences are all around us: they arise when agents seek to be allocated to one another on the basis of ranked preferences over potential outcomes. Efficient algorithms are needed for producing matchings that optimise the satisfaction of the agents according to their preference lists. In recent years there has been a sharp increase in the study of algorithmic aspects of matching problems with preferences, partly reflecting the growing number of applications of these problems worldwide. The importance of the research area was recognised in 2012 through the award of the Nobel Prize in Economic Sciences to Alvin Roth and Lloyd Shapley. This book describes the most important results in this area, providing a timely update to The Stable Marriage Problem: Structure and Algorithms (D Gusfield and R W Irving, MIT Press, 1989) in connection with stable matching problems, whilst also broadening the scope to include matching problems with preferences under a range of alternative optimality criteria. Contents:Preliminary Definitions, Results and MotivationStable Matching Problems:The Stable Marriage Problem: An UpdateSM and HR with IndifferenceThe Stable Roommates ProblemFurther Stable Matching ProblemsOther Optimal Matching Problems:Pareto Optimal MatchingsPopular MatchingsProfile-Based Optimal Matchings Readership: Students and Professionals interested in algorithms, especially in the study of algorithmic aspects of matching problems with preferences. Keywords:Matching Problems;Preferences;Algorithms;Stable Marriage Problem;Hospitals / Residents Problem;House Allocation Problem;Stable Roomates ProblemKey Features:Provides a much-needed “sequel” to Gusfield and Irving, given that so many papers on matching problems with preferences have been published since 1989Collects together a survey of the main results from these publications in a single volumeContains unique single survey on efficient algorithms for constructing optimal matchings where the optimality criterion does not involve stabilityReviews: “Besides being extremely useful to those who are interested in design and analysis techniques related to algorithms and complexity issues related to the matching of agents to one another when preferences are involved, involved readers can also benefit from the easy way it presents various ideas and approaches to problem solutions. It is written in a highly scientific language and it is extraordinarily beneficial reading for post-docs and researchers in mathematics and in game theory that focus on algorithms for solving matching problems and also study applications involving such problems.” Zentralblatt MATH