Description: Further DetailsTitle: Combinatorial Optimization and Graph AlgorithmsCondition: NewSubtitle: Communications of NII Shonan MeetingsEAN: 9789811355813ISBN: 9789811355813Edition: Softcover reprint of the original 1st ed. 2017Publisher: Springer Verlag, SingaporeFormat: PaperbackRelease Date: 12/11/2018Description: Covering network designs, discrete convex analysis, facility location and clustering problems, matching games, and parameterized complexity, this book discusses theoretical aspects of combinatorial optimization and graph algorithms. Contributions are by renowned researchers who attended NII Shonan meetings on this essential topic. The collection contained here provides readers with the outcome of the authors’ research and productive meetings on this dynamic area, ranging from computer science and mathematics to operations research. Networks are ubiquitous in today's world: the Web, online social networks, and search-and-query click logs can lead to a graph that consists of vertices and edges. Such networks are growing so fast that it is essential to design algorithms to work for these large networks. Graph algorithms comprise an area in computer science that works to design efficient algorithms for networks. Here one can work on theoretical or practical problems where implementation of an algorithm for large networks is needed. In two of the chapters, recent results in graph matching games and fixed parameter tractability are surveyed. Combinatorial optimization is an intersection of operations research and mathematics, especially discrete mathematics, which deals with new questions and new problems, attempting to find an optimum object from a finite set of objects. Most problems in combinatorial optimization are not tractable (i.e., NP-hard). Therefore it is necessary to design an approximation algorithm for them. To tackle these problems requires the development and combination of ideas and techniques from diverse mathematical areas including complexity theory, algorithm theory, and matroids as well as graph theory, combinatorics, convex and nonlinear optimization, and discrete and convex geometry. Overall, the book presents recent progress in facility location, network design, and discrete convex analysis.Language: EnglishCountry/Region of Manufacture: SGItem Height: 235mmItem Length: 155mmContributor: Takuro Fukunaga (Edited by), Ken-ichi Kawarabayashi (Edited by)Author: Takuro FukunagaGenre: Business & FinanceTopic: Computing & Internet, Science Nature & MathRelease Year: 2018 Missing Information?Please contact us if any details are missing and where possible we will add the information to our listing.
Price: 178.26 USD
Location: GU14 0GT
End Time: 2024-11-24T20:37:49.000Z
Shipping Cost: 0 USD
Product Images
Item Specifics
Return shipping will be paid by: Buyer
All returns accepted: Returns Accepted
Item must be returned within: 30 Days
Refund will be given as: Money back or replacement (buyer's choice)
Return policy details:
Book Title: Combinatorial Optimization and Graph Algorithms
Title: Combinatorial Optimization and Graph Algorithms
Subtitle: Communications of NII Shonan Meetings
EAN: 9789811355813
ISBN: 9789811355813
Edition: Softcover reprint of the original 1st ed. 2017
Release Date: 12/11/2018
Release Year: 2018
Country/Region of Manufacture: SG
Item Height: 235mm
Contributor: Ken-ichi Kawarabayashi (Edited by)
Genre: Business & Finance
Topic: Science Nature & Math
Number of Pages: IX, 120 Pages
Language: English
Publication Name: Combinatorial Optimization and Graph Algorithms : Communications of Nii Shonan Meetings
Publisher: Springer
Publication Year: 2018
Subject: Operations Research, Computer Science, Algebra / General, Combinatorics, Discrete Mathematics
Item Weight: 16 Oz
Type: Textbook
Subject Area: Mathematics, Computers, Business & Economics
Item Length: 9.3 in
Author: Ken-Ichi Kawarabayashi
Item Width: 6.1 in
Format: Trade Paperback
