This book gives a comprehensive presentation of cutting-edge research in communication networks with a combinatorial optimization component. The objective of the book is to advance and promote the theory and applications of combinatorial optimization in communication networks. Each chapter is writte
Combinatorial Optimization in Communication Networks
โ Scribed by Maggie Xiaoyan Cheng, Yingshu Li, Ding-Zhu Du
- Publisher
- Springer
- Year
- 2006
- Tongue
- English
- Leaves
- 651
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
This book gives a comprehensive presentation of cutting-edge research in communication networks with a combinatorial optimization component. The objective of the book is to advance and promote the theory and applications of combinatorial optimization in communication networks. Each chapter is written by an expert dealing with theoretical, computational, or applied aspects of combinatorial optimization.
๐ SIMILAR VOLUMES
MODELING and OPTIMIZATION of OPTICAL COMMUNICATION NETWORKS Optical networks are an integral part of many of the technologies that we use every day. It is a constantly changing and evolving area, with new materials, processes, and applications coming online almost daily. This book provides a b
Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the ma
A basic problem for the interconnection of communications media is to design interconnection networks for specific needs. For example, to minimize delay and to maximize reliability, networks are required that have minimum diameter and maximum connectivity under certain conditions. The book provi
Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the ma