Feedback Arc Set

Author : Robert Kudelić
Publisher : Springer Nature
Page : 134 pages
File Size : 46,9 Mb
Release : 2022-10-10
Category : Computers
ISBN : 9783031105159

Get Book

Feedback Arc Set by Robert Kudelić Pdf

The main aim of the book is to give a review of all relevant information regarding a well-known and important problem of Feedback Arc Set (FAS). This review naturally also includes a history of the problem, as well as specific algorithms. To this point such a work does not exist: There are sources where one can find incomplete and perhaps untrustworthy information. With this book, information about FAS can be found easily in one place: formulation, description, theoretical background, applications, algorithms etc. Such a compendium will be of help to people involved in research, but also to people that want to quickly acquaint themselves with the problem and need reliable information. Thus research, professional work and learning can proceed in a more streamlined and faster way.

Author : Ding-Zhu Du,Panos M. Pardalos
Publisher : Springer Science & Business Media
Page : 650 pages
File Size : 51,7 Mb
Release : 2013-03-14
Category : Mathematics
ISBN : 9781475730234

Get Book

Handbook of Combinatorial Optimization by Ding-Zhu Du,Panos M. Pardalos Pdf

Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied math ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, air line crew scheduling, corporate planning, computer-aided design and man ufacturing, database query design, cellular telephone frequency assignment, constraint directed reasoning, and computational biology. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. All these problems, when formulated mathematically as the minimization or maximization of a certain function defined on some domain, have a commonality of discreteness. Historically, combinatorial optimization starts with linear programming. Linear programming has an entire range of important applications including production planning and distribution, personnel assignment, finance, alloca tion of economic resources, circuit simulation, and control systems. Leonid Kantorovich and Tjalling Koopmans received the Nobel Prize (1975) for their work on the optimal allocation of resources. Two important discover ies, the ellipsoid method (1979) and interior point approaches (1984) both provide polynomial time algorithms for linear programming. These algo rithms have had a profound effect in combinatorial optimization. Many polynomial-time solvable combinatorial optimization problems are special cases of linear programming (e.g. matching and maximum flow). In addi tion, linear programming relaxations are often the basis for many approxi mation algorithms for solving NP-hard problems (e.g. dual heuristics).

Author : Alexander Schrijver
Publisher : Springer Science & Business Media
Page : 2024 pages
File Size : 54,6 Mb
Release : 2003-02-12
Category : Business & Economics
ISBN : 3540443894

Get Book

Combinatorial Optimization by Alexander Schrijver Pdf

From the reviews: "About 30 years ago, when I was a student, the first book on combinatorial optimization came out referred to as "the Lawler" simply. I think that now, with this volume Springer has landed a coup: "The Schrijver". The box is offered for less than 90.- EURO, which to my opinion is one of the best deals after the introduction of this currency." OR-Spectrum

Author : Steven S Skiena
Publisher : Springer Science & Business Media
Page : 742 pages
File Size : 42,7 Mb
Release : 2009-04-05
Category : Computers
ISBN : 9781848000704

Get Book

The Algorithm Design Manual by Steven S Skiena Pdf

This newly expanded and updated second edition of the best-selling classic continues to take the "mystery" out of designing algorithms, and analyzing their efficacy and efficiency. Expanding on the first edition, the book now serves as the primary textbook of choice for algorithm design courses while maintaining its status as the premier practical reference guide to algorithms for programmers, researchers, and students. The reader-friendly Algorithm Design Manual provides straightforward access to combinatorial algorithms technology, stressing design over analysis. The first part, Techniques, provides accessible instruction on methods for designing and analyzing computer algorithms. The second part, Resources, is intended for browsing and reference, and comprises the catalog of algorithmic resources, implementations and an extensive bibliography. NEW to the second edition: • Doubles the tutorial material and exercises over the first edition • Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video • Contains a unique catalog identifying the 75 algorithmic problems that arise most often in practice, leading the reader down the right path to solve them • Includes several NEW "war stories" relating experiences from real-world applications • Provides up-to-date links leading to the very best algorithm implementations available in C, C++, and Java

Author : Jorgen Bang-Jensen,Gregory Z. Gutin
Publisher : Springer Science & Business Media
Page : 769 pages
File Size : 50,5 Mb
Release : 2013-06-29
Category : Mathematics
ISBN : 9781447138860

Get Book

Digraphs by Jorgen Bang-Jensen,Gregory Z. Gutin Pdf

The study of directed graphs (digraphs) has developed enormously over recent decades, yet the results are rather scattered across the journal literature. This is the first book to present a unified and comprehensive survey of the subject. In addition to covering the theoretical aspects, the authors discuss a large number of applications and their generalizations to topics such as the traveling salesman problem, project scheduling, genetics, network connectivity, and sparse matrices. Numerous exercises are included. For all graduate students, researchers and professionals interested in graph theory and its applications, this book will be essential reading.

Author : Hideko S. Kunii,Sushil Jajodia,Arne Soelvberg
Publisher : Springer
Page : 620 pages
File Size : 40,5 Mb
Release : 2003-06-30
Category : Computers
ISBN : 9783540455813

Get Book

Conceptual Modeling - ER 2001 by Hideko S. Kunii,Sushil Jajodia,Arne Soelvberg Pdf

This book constitutes the refereed proceedings of the 20th International Conference on Conceptual Modeling, ER 2001, held in Tokohama, Japan, in November 2001. The 45 revised full papers presented together with three keynote presentations were carefully reviewed and selected from a total of 197 submissions. The papers are organized in topical sections on spatial databases, spatio-temporal databases, XML, information modeling, database design, data integration, data warehouse, UML, conceptual models, systems design, method reengineering and video databases, workflows, web information systems, applications, and software engineering.

Author : Jørgen Bang-Jensen,Gregory Z. Gutin
Publisher : Springer Science & Business Media
Page : 795 pages
File Size : 41,9 Mb
Release : 2008-12-17
Category : Mathematics
ISBN : 9781848009981

Get Book

Digraphs by Jørgen Bang-Jensen,Gregory Z. Gutin Pdf

Substantially revised, reorganised and updated, the second edition now comprises eighteen chapters, carefully arranged in a straightforward and logical manner, with many new results and open problems. As well as covering the theoretical aspects of the subject, with detailed proofs of many important results, the authors present a number of algorithms, and whole chapters are devoted to topics such as branchings, feedback arc and vertex sets, connectivity augmentations, sparse subdigraphs with prescribed connectivity, and also packing, covering and decompositions of digraphs. Throughout the book, there is a strong focus on applications which include quantum mechanics, bioinformatics, embedded computing, and the travelling salesman problem. Detailed indices and topic-oriented chapters ease navigation, and more than 650 exercises, 170 figures and 150 open problems are included to help immerse the reader in all aspects of the subject.

Author : Marek Cygan,Fedor V. Fomin,Łukasz Kowalik,Daniel Lokshtanov,Dániel Marx,Marcin Pilipczuk,Michał Pilipczuk,Saket Saurabh
Publisher : Springer
Page : 613 pages
File Size : 55,7 Mb
Release : 2015-07-20
Category : Computers
ISBN : 9783319212753

Get Book

Parameterized Algorithms by Marek Cygan,Fedor V. Fomin,Łukasz Kowalik,Daniel Lokshtanov,Dániel Marx,Marcin Pilipczuk,Michał Pilipczuk,Saket Saurabh Pdf

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 presents complexity 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.

Author : Jianer Chen,Barry S. Cooper
Publisher : Springer
Page : 482 pages
File Size : 50,9 Mb
Release : 2009-05-12
Category : Computers
ISBN : 9783642020179

Get Book

Theory and Applications of Models of Computation by Jianer Chen,Barry S. Cooper Pdf

This book constitutes the refereed proceedings of the 6th International Conference on Theory and Applications of Models of Computation, TAMC 2009, held in Changsha, China in May 2009. The 39 full papers presented together with 7 invited papers as well as 3 plenary talks were selected from 86 submissions. The papers address the three main themes of the conference which were Computability, Complexity, and Algorithms. The conference aimed to bring together researchers with interests in theoretical computer science, algorithmic mathematics, and applications to the physical sciences.

Author : Christodoulos A. Floudas,Panos M. Pardalos
Publisher : Springer Science & Business Media
Page : 4646 pages
File Size : 54,7 Mb
Release : 2008-09-04
Category : Mathematics
ISBN : 9780387747583

Get Book

Encyclopedia of Optimization by Christodoulos A. Floudas,Panos M. Pardalos Pdf

The goal of the Encyclopedia of Optimization is to introduce the reader to a complete set of topics that show the spectrum of research, the richness of ideas, and the breadth of applications that has come from this field. The second edition builds on the success of the former edition with more than 150 completely new entries, designed to ensure that the reference addresses recent areas where optimization theories and techniques have advanced. Particularly heavy attention resulted in health science and transportation, with entries such as "Algorithms for Genomics", "Optimization and Radiotherapy Treatment Design", and "Crew Scheduling".

Author : Jørgen Bang-Jensen,Gregory Gutin
Publisher : Springer
Page : 636 pages
File Size : 51,5 Mb
Release : 2018-06-18
Category : Mathematics
ISBN : 9783319718408

Get Book

Classes of Directed Graphs by Jørgen Bang-Jensen,Gregory Gutin Pdf

This edited volume offers a detailed account of the theory of directed graphs from the perspective of important classes of digraphs, with each chapter written by experts on the topic. Outlining fundamental discoveries and new results obtained over recent years, this book provides a comprehensive overview of the latest research in the field. It covers core new results on each of the classes discussed, including chapters on tournaments, planar digraphs, acyclic digraphs, Euler digraphs, graph products, directed width parameters, and algorithms. Detailed indices ease navigation while more than 120 open problems and conjectures ensure that readers are immersed in all aspects of the field. Classes of Directed Graphs provides a valuable reference for graduate students and researchers in computer science, mathematics and operations research. As digraphs are an important modelling tool in other areas of research, this book will also be a useful resource to researchers working in bioinformatics, chemoinformatics, sociology, physics, medicine, etc.

Author : Frank Dehne,Rod Downey,Michael Fellows
Publisher : Springer
Page : 300 pages
File Size : 45,8 Mb
Release : 2004-10-14
Category : Computers
ISBN : 9783540286394

Get Book

Parameterized and Exact Computation by Frank Dehne,Rod Downey,Michael Fellows Pdf

Thecentralchallengeoftheoreticalcomputerscienceistodeploymathematicsin waysthatservethecreationofusefulalgorithms. Inrecentyearstherehasbeena growinginterest in the two-dimensionalframework of parameterizedcomplexity, where, in addition to the overall input size, one also considers a parameter,with a focus on how these two dimensions interact in problem complexity. This book presents the proceedings of the 1st InternationalWorkshopon - rameterized and Exact Computation (IWPEC 2004,http://www. iwpec. org), which took place in Bergen, Norway, on September 14-16, 2004. The workshop was organized as part of ALGO 2004. There were seven previous workshops on the theory and applications of parameterized complexity. The ?rst was - ganized at the Institute for the Mathematical Sciences in Chennai, India, in September, 2000. The second was held at Dagstuhl Castle, Germany, in July, 2001. In December, 2002, a workshop on parameterized complexity was held in conjunction with the FST-TCS meeting in Kanpur, India. A second Dagstuhl workshop on parameterized complexity was held in July, 2003. Another wo- shoponthesubjectwasheldinOttawa,Canada,inAugust,2003,inconjunction with the WADS 2003 meeting. There have also been two Barbados workshops on applications of parameterized complexity. In response to the IWPEC 2004 call for papers, 47 papers were submitted, and from these the programcommittee selected 25 for presentation at the wo- shop. Inaddition,invitedlectureswereacceptedbythedistinguishedresearchers Michael Langston and Gerhard Woeginger.

Author : Branislav Rovan,Vladimiro Sassone,Peter Widmayer
Publisher : Springer
Page : 825 pages
File Size : 42,8 Mb
Release : 2012-08-01
Category : Computers
ISBN : 9783642325892

Get Book

Mathematical Foundations of Computer Science 2012 by Branislav Rovan,Vladimiro Sassone,Peter Widmayer Pdf

This volume constitutes the refereed proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science, MFCS 2012, held in Bratislava, Slovakia, in August 2012. The 63 revised full papers presented together with 8 invited talks were carefully reviewed and selected from 162 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence.

Author : Susanne Albers,Alberto Marchetti-Spaccamela,Yossi Matias,Sotiris Nikoletseas,Wolfgang Thomas
Publisher : Springer Science & Business Media
Page : 808 pages
File Size : 51,9 Mb
Release : 2009-07-06
Category : Computers
ISBN : 9783642029271

Get Book

Automata, Languages and Programming by Susanne Albers,Alberto Marchetti-Spaccamela,Yossi Matias,Sotiris Nikoletseas,Wolfgang Thomas Pdf

Author : Michel Goemans,Klaus Jansen,Jose D.P. Rolim,Luca Trevisan
Publisher : Springer
Page : 296 pages
File Size : 53,6 Mb
Release : 2003-05-15
Category : Mathematics
ISBN : 9783540446668

Get Book

Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques by Michel Goemans,Klaus Jansen,Jose D.P. Rolim,Luca Trevisan Pdf

This book constitutes the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Ranomization and Approximation Techniques in Computer Science, RANDOM 2001, held in Berkeley, California, USA in August 2001. The 26 revised full papers presented were carefully reviewed and selected from a total of 54 submissions. Among the issues addressed are design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization, de-randomization, average-case analysis, approximation classes, randomized complexity theory, scheduling, routing, coloring, partitioning, packing, covering, computational geometry, network design, and applications in various fields.