3. Online Models for Set-covering: the Flaw of Greediness

  1. Vangelis Th. Paschos
  1. Giorgio Ausiello,
  2. Aristotelis Giannakos and
  3. Vangelis Th. Paschos

Published Online: 3 FEB 2010

DOI: 10.1002/9780470611098.ch3

Combinatorial Optimization and Theoretical Computer Science

Combinatorial Optimization and Theoretical Computer Science

How to Cite

Ausiello, G., Giannakos, A. and Paschos, V. Th. (2008) Online Models for Set-covering: the Flaw of Greediness, in Combinatorial Optimization and Theoretical Computer Science (ed V. Th. Paschos), ISTE, London, UK. doi: 10.1002/9780470611098.ch3

Publication History

  1. Published Online: 3 FEB 2010
  2. Published Print: 1 JAN 2008

ISBN Information

Print ISBN: 9781848210219

Online ISBN: 9780470611098

SEARCH

Keywords:

  • online algorithm;
  • feasible solutions;
  • seminal paper;
  • competitive ratio;
  • algorithms dealing

Summary

This chapter contains sections titled:

  • Introduction

  • Description of the main results and related work

  • The price of ignorance

  • Competitiveness of TAKE-ALL and TAKE-AT-RANDOM

  • The nasty flaw of greediness

  • The power of look-ahead

  • The maximum budget saving problem

  • Discussion

  • Bibliography