Overview
- Presents open optimization problems in graph theory and networks
- Features advanced methods and techniques in combinatorial optimization and directed graphs
- Highlights applications to design efficient algorithms
Part of the book series: Springer Optimization and Its Applications (SOIA, volume 139)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (13 chapters)
Keywords
About this book
This book presents open optimization problems in graph theory and networks. Each chapter reflects developments in theory and applications based on Gregory Gutin’s fundamental contributions to advanced methods and techniques in combinatorial optimization.
Researchers, students, and engineers in computer science, big data, applied mathematics, operations research, algorithm design, artificial intelligence, software engineering, data analysis, industrial and systems engineering will benefit from the state-of-the-art results presented in modern graph theory and its applications to the design of efficient algorithms for optimization problems.
Topics covered in this work include:
· Algorithmic aspects of problems with disjoint cycles in graphs· Graphs where maximal cliques and stable sets intersect
· The maximum independent set problem with special classes
· A general technique for heuristic algorithms for optimization problems
· The network design problem with cut constraints
· Algorithms for computing the frustration index of a signed graph
· A heuristic approach for studying the patrol problem on a graph
· Minimum possible sum and product of the proper connection number· Structural and algorithmic results on branchings in digraphs
· Improved upper bounds for Korkel--Ghosh benchmark SPLP instances
Editors and Affiliations
Bibliographic Information
Book Title: Optimization Problems in Graph Theory
Book Subtitle: In Honor of Gregory Z. Gutin's 60th Birthday
Editors: Boris Goldengorin
Series Title: Springer Optimization and Its Applications
DOI: https://doi.org/10.1007/978-3-319-94830-0
Publisher: Springer Cham
eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)
Copyright Information: Springer Nature Switzerland AG 2018
Hardcover ISBN: 978-3-319-94829-4Published: 11 October 2018
Softcover ISBN: 978-3-030-06921-6Published: 13 December 2018
eBook ISBN: 978-3-319-94830-0Published: 27 September 2018
Series ISSN: 1931-6828
Series E-ISSN: 1931-6836
Edition Number: 1
Number of Pages: XVIII, 331
Number of Illustrations: 65 b/w illustrations, 22 illustrations in colour
Topics: Optimization, Logistics, Combinatorics, Algorithms, Graph Theory