Greedy Algorithms

Greedy Algorithms

Greedy Algorithms, edited by Witold Bednorz, is a free 586 page book from InTech. You can view it online or download in pdf format. A greedy algorithm is an algorithm that follows the problem solving heuristic of making the locally optimal choice at each stage with the hope of finding a global optimum.

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.


  • A Greedy Algorithm with Forward-Looking Strategy
  • A Greedy Scheme for Designing Delay Monitoring Systems of IP Networks
  • A Multilevel Greedy Algorithm for the Satisfiability Problem
  • A Multi-start Local Search Approach to the Multiple Container Loading Problem
  • A Partition-Based Suffix Tree Construction and Its Applications
  • Bayesian Framework for State Estimation and Robot Behaviour Selection in Dynamic Environments
  • Efficient Multi-User Parallel Greedy Bit-Loading Algorithm with Fairness Control For DMT Systems
  • Energy Efficient Greedy Approach for Sensor Networks
  • Enhancing Greedy Policy Techniques for Complex Cost-Sensitive Problems
  • Greedy Algorithm: Exploring Potential of Link Adaptation Technique in Wideband Wireless Communication Systems
  • Greedy Algorithms for Mapping onto a Coarse-grained Reconfigurable Fabric
  • Greedy Algorithms for Spectrum Management in OFDM Cognitive Systems – Applications to Video Streaming and Wireless Sensor Networks
  • Greedy Algorithms in Survivable Optical Networks
  • Greedy Algorithms to Determine Stable Paths and Trees in Mobile Ad hoc Networks
  • Greedy Anti-Void Forwarding Strategies for Wireless Sensor Networks
  • Greedy Like Algorithms for the Traveling Salesman and Multidimensional Assignment Problems
  • Greedy Methods in Plume Detection, Localization and Tracking
  • Greedy Type Bases in Banach Spaces
  • Hardware-oriented Ant Colony Optimization Considering Intensification and Diversification
  • Heuristic Algorithms for Solving Bounded Diameter Minimum Spanning Tree Problem and Its Application to Genetic Algorithm Development
  • Opportunistic Scheduling for Next Generation Wireless Local Area Networks
  • Parallel Greedy Approximation on Large-Scale Combinatorial Auctions
  • Parallel Search Strategies for TSPs Using a Greedy Genetic Algorithm
  • Provably-Efficient Online Adaptive Scheduling of Parallel Jobs Based on Simple Greedy Rules
  • Quasi-Concave Functions and Greedy Algorithms
  • Semantic Matchmaking Algorithms
  • Solving Inter-AS Bandwidth Guaranteed Provisioning Problems with Greedy Heuristics
  • Solving the High School Scheduling Problem Modelled with Constraints Satisfaction Using Hybrid Heuristic Algorithms
  • Toward Improving b-Coloring Based Clustering Using a Greedy re-Coloring Algorithm
  • WDM Optical Networks Planning Using Greedy Algorithms

Book Details

Author(s): Witold Bednorz
Publisher: InTech
Format(s): PDF
File size: 46.80 MB
Number of pages: 586
Link: Download.

Leave a Reply