Submodular Set Functions, Matroids and the Greedy Algorithm: Tight Worst-Case Bounds and Some Generalizations of the Rado-Edmonds Theorem.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1983
Accession Number
ADA124981

Entities

People

  • Gérard Cornuéjols
  • Michele Conforti

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Human Systems

DTIC Thesaurus Topics

  • Additives (Chemicals)
  • Algorithms
  • Curvature
  • Evolutionary Algorithms
  • Guarantees
  • Heuristic Methods
  • Inequalities
  • Integrals
  • Iterations
  • Linear Programming
  • Military Research
  • Optimization
  • Schools
  • Sequences
  • Universities