Greedy Algorithms
by Witold Bednorz
DescriptionTable of ContentsDetailsHashtagsReport an issue 
Book Description
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 open book is licensed under a Creative Commons License (CC BY-NC-SA). You can download Greedy Algorithms ebook for free in PDF format (23.6 MB).
Table of Contents
Chapter 1
A Greedy Algorithm with Forward-Looking Strategy
Chapter 2
A Greedy Scheme for Designing Delay Monitoring Systems of IP Networks
Chapter 3
A Multilevel Greedy Algorithm for the Satisfiability Problem
Chapter 4
A Multi-start Local Search Approach to the Multiple Container Loading Problem
Chapter 5
A Partition-Based Suffix Tree Construction and Its Applications
Chapter 6
Bayesian Framework for State Estimation and Robot Behaviour Selection in Dynamic Environments
Chapter 7
Efficient Multi-User Parallel Greedy Bit-Loading Algorithm with Fairness Control For DMT Systems
Chapter 8
Energy Efficient Greedy Approach for Sensor Networks
Chapter 9
Enhancing Greedy Policy Techniques for Complex Cost-Sensitive Problems
Chapter 10
Greedy Algorithm: Exploring Potential of Link Adaptation Technique in Wideband Wireless Communication Systems
Chapter 11
Greedy Algorithms for Mapping onto a Coarse-grained Reconfigurable Fabric
Chapter 12
Greedy Algorithms for Spectrum Management in OFDM Cognitive Systems - Applications to Video
Chapter 13
Greedy Algorithms in Survivable Optical Networks
Chapter 14
Greedy Algorithms to Determine Stable Paths and Trees in Mobile Ad hoc Networks
Chapter 15
Greedy Anti-Void Forwarding Strategies for Wireless Sensor Networks
Chapter 16
Greedy Like Algorithms for the Traveling Salesman and Multidimensional Assignment Problems
Chapter 17
Greedy Methods in Plume Detection, Localization and Tracking
Chapter 18
Greedy Type Bases in Banach Spaces
Chapter 19
Hardware-oriented Ant Colony Optimization Considering Intensification and Diversification
Chapter 20
Heuristic Algorithms for Solving Bounded Diameter Minimum Spanning Tree Problem and Its Application to Genetic Algorithm Development
Chapter 21
Opportunistic Scheduling for Next Generation Wireless Local Area Networks
Chapter 22
Parallel Greedy Approximation on Large-Scale Combinatorial Auctions
Chapter 23
Parallel Search Strategies for TSPs Using a Greedy Genetic Algorithm
Chapter 24
Provably-Efficient Online Adaptive Scheduling of Parallel Jobs Based on Simple Greedy Rules
Chapter 25
Quasi-Concave Functions and Greedy Algorithms
Chapter 26
Semantic Matchmaking Algorithms
Chapter 27
Solving Inter-AS Bandwidth Guaranteed Provisioning Problems with Greedy Heuristics
Chapter 28
Solving the High School Scheduling Problem Modelled with Constraints Satisfaction Using Hybrid Heuristic Algorithms
Chapter 29
Toward Improving b-Coloring Based Clustering Using a Greedy re-Coloring Algorithm
Chapter 30
WDM Optical Networks Planning Using Greedy Algorithms
Book Details
Title
Greedy Algorithms
Subject
Computer Science
Publisher
IntechOpen
Published
2008
Pages
600
Edition
1
Language
English
ISBN13
9789537619275
ISBN10
9537619273
ISBN13 Digital
9789535157984
ISBN10 Digital
9535157981
PDF Size
23.6 MB
License
Related Books
Algorithms are the lifeblood of computer science. They are the machines that proofs build and the music that programs play. Their history is as old as mathematics itself. This book is a wide-ranging, idiosyncratic treatise on the design and analysis of algorithms, covering several fundamental techniques, with an emphasis on intuition and the proble...
This book is assembled from lectures given by the author over a period of 10 years at the School of Computing of DePaul University. The lectures cover multiple classes, including Analysis and Design of Algorithms, Scientific Computing, Monte Carlo Simulations, and Parallel Algorithms. These lectures teach the core knowledge required by any scientis...
The Algorithms Notes for Professionals book is compiled from Stack Overflow Documentation, the content is written by the beautiful people at Stack Overflow....
The purpose of this book is to give you a thorough introduction to competitive programming. It is assumed that you already know the basics of programming, but no previous background in competitive programming is needed.
The book is especially intended for students who want to learn algorithms and possibly participate in the International Olympi...
This book is a modern guide for all C++ programmers to learn Threading Building Blocks (TBB). Written by TBB and parallel programming experts, this book reflects their collective decades of experience in developing and teaching parallel programming with TBB, offering their insights in an approachable manner. Throughout the book the authors present ...
This book bridges the gap between playing with robots in school and studying robotics at the upper undergraduate and graduate levels to prepare for careers in industry and research. Robotic algorithms are presented formally, but using only mathematics known by high-school and first-year college students, such as calculus, matrices and probability. ...