Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 2165210

From MaRDI portal
Publication:4675464
Jump to:navigation, search

zbMATH Open1099.90032MaRDI QIDQ4675464FDOQ4675464


Authors: A. S. Talevnin, Victor Petrovich Il'ev Edit this on Wikidata


Publication date: 4 May 2005



Title of this publication is not available (Why is that?)



Recommendations

  • Hereditary systems and greedy-type algorithms.
  • Performance guarantees for greedy algorithms for problems on hereditary systems
  • A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids
  • scientific article; zbMATH DE number 3863198
  • scientific article; zbMATH DE number 169611


zbMATH Keywords

greedy algorithmworst case analysisindependent system


Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Boolean programming (90C09)



Cited In (6)

  • Performance guarantees for greedy algorithms for problems on hereditary systems
  • Maximal Hypergraphs with Respect to the Bounded Cost Hereditary Property
  • Hereditary properties of solutions of the four block problem
  • Hereditary systems and greedy-type algorithms.
  • Title not available (Why is that?)
  • On the equivalence of different classes of hereditary systems





This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4675464)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4675464&oldid=18891157"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 18:04. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki