To purchase hard copies of this book, please email:
orders@intechopen.com
By only printing on demand InTech ensures our carbon footprint is kept to a minimum.
The data below shows the environmental impact of printing one single book:
84.56 kg wood
4.55 g CO2
76.78 ml Water
Share this page
Greedy Algorithms
Edited by Witold Bednorz, ISBN 978-953-7619-27-5, Hard cover, 586 pages, Publisher: InTech, Published: November 01, 2008 under CC BY-NC-SA 3.0 license, in subject Numerical Analysis and Scientific Computing
Each chapter comprises a separate study on some optimization problem giving both an introductory look into the theory the problem comes from and some new developments invented by author(s). Usually some elementary knowledge is assumed, yet all the required facts are quoted mostly in examples, remarks or theorems.
This book is indexed in:
Book contents
- Chapter 1A Greedy Algorithm with Forward-Looking Strategy
- Chapter 2A Greedy Scheme for Designing Delay Monitoring Systems of IP Networks
- Chapter 3A Multilevel Greedy Algorithm for the Satisfiability Problem
- Chapter 4A Multi-start Local Search Approach to the Multiple Container Loading Problem
- Chapter 5A Partition-Based Suffix Tree Construction and Its Applications
- Chapter 6Bayesian Framework for State Estimation and Robot Behaviour Selection in Dynamic Environments
- Chapter 7Efficient Multi-User Parallel Greedy Bit-Loading Algorithm with Fairness Control For DMT Systems
- Chapter 8Energy Efficient Greedy Approach for Sensor Networks
- Chapter 9Enhancing Greedy Policy Techniques for Complex Cost-Sensitive Problems
- Chapter 10Greedy Algorithm: Exploring Potential of Link Adaptation Technique in Wideband Wireless Communication Systems
- Chapter 11Greedy Algorithms for Mapping onto a Coarse-grained Reconfigurable Fabric
- Chapter 12Greedy Algorithms for Spectrum Management in OFDM Cognitive Systems - Applications to Video Streaming and Wireless Sensor Networks
- Chapter 13Greedy Algorithms in Survivable Optical Networks
- Chapter 14Greedy Algorithms to Determine Stable Paths and Trees in Mobile Ad hoc Networks
- Chapter 15Greedy Anti-Void Forwarding Strategies for Wireless Sensor Networks
- Chapter 16Greedy Like Algorithms for the Traveling Salesman and Multidimensional Assignment Problems
- Chapter 17Greedy Methods in Plume Detection, Localization and Tracking
- Chapter 18Greedy Type Bases in Banach Spaces
- Chapter 19Hardware-oriented Ant Colony Optimization Considering Intensification and Diversification
- Chapter 20Heuristic Algorithms for Solving Bounded Diameter Minimum Spanning Tree Problem and Its Application to Genetic Algorithm Development
- Chapter 21Opportunistic Scheduling for Next Generation Wireless Local Area Networks
- Chapter 22Parallel Greedy Approximation on Large-Scale Combinatorial Auctions
- Chapter 23Parallel Search Strategies for TSPs Using a Greedy Genetic Algorithm
- Chapter 24Provably-Efficient Online Adaptive Scheduling of Parallel Jobs Based on Simple Greedy Rules
- Chapter 25Quasi-Concave Functions and Greedy Algorithms
- Chapter 26Semantic Matchmaking Algorithms
- Chapter 27Solving Inter-AS Bandwidth Guaranteed Provisioning Problems with Greedy Heuristics
- Chapter 28Solving the High School Scheduling Problem Modelled with Constraints Satisfaction Using Hybrid Heuristic Algorithms
- Chapter 29Toward Improving b-Coloring Based Clustering Using a Greedy re-Coloring Algorithm
- Chapter 30WDM Optical Networks Planning Using Greedy Algorithms
