
Optimization Problems in Graph Theory
In Honor of Gregory Z. Gutin's 60th Birthday
Boris Goldengorin(Editor)
Springer (Publisher)
Published on 11. October 2018
Book
Hardback
XVIII, 331 pages
978-3-319-94829-4 (ISBN)
Description
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
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
More details
Product info
Book
Series
Edition
1st ed. 2018
Language
English
Place of publication
Cham
Switzerland
Publishing group
Springer International Publishing
Target group
Professional and scholarly
Illustrations
65 s/w Abbildungen, 22 farbige Abbildungen
Bibliographie
Dimensions
Height: 241 mm
Width: 160 mm
Thickness: 25 mm
Weight
694 gr
ISBN-13
978-3-319-94829-4 (9783319948294)
DOI
10.1007/978-3-319-94830-0
Schweitzer Classification
Other editions
Additional editions

Book
12/2018
Springer
€128.39
Shipment within 7-9 days

E-Book
09/2018
1st Edition
Springer
€128.39
Available for download
Content