|
Books > Business & Economics > Business & management > Management & management techniques > Operational research
|
Not currently available
Combinatorial Optimization and Graph Algorithms - Communications of NII Shonan Meetings (Paperback, Softcover reprint of the original 1st ed. 2017)
Loot Price: R2,833
Discovery Miles 28 330
|
|
|
Combinatorial Optimization and Graph Algorithms - Communications of NII Shonan Meetings (Paperback, Softcover reprint of the original 1st ed. 2017)
Supplier out of stock. If you add this item to your wish list we will let you know when it becomes available.
|
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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
|
You might also like..
|
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
