Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

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

zbMath0694.90080MaRDI QIDQ3470255

Bernhard Korte, László Lovász, Oskar Goecke

Publication date: 1989


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

matroidsantimatroidsbottleneck functionGreedoids


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Enumerative combinatorics (05A99)


Related Items

Resolutions of convex geometries, Compressed representation of learning spaces, A greedy algorithm for some classes of integer programs., Convexity properties for interior operator games, The computational complexity of antimatroid properties, Characterizations of polygreedoids and poly-antimatroids by greedy algorithms, A greedy algorithm for maximizing a linear objective function, Secretary problem: graphs, matroids and greedoids, Values for interior operator games



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3470255&oldid=16800353"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 4 February 2024, at 22:09.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki