Amanote Research

Amanote Research

    RegisterSign In

On Greedy Algorithms, Partially Ordered Sets, and Submodular Functions

IBM Journal of Research and Development - United States
doi 10.1147/rd.471.0025
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer Science
Date

January 1, 2003

Authors
B. L. DietrichA. J. Hoffman
Publisher

IBM


Related search

On Generalized Derivations of Partially Ordered Sets

Communications in Mathematics
Mathematics
2019English

Partially Ordered Sets and Semi-Simplicial Complexes

Bulletin of the Faculty of Science, Ibaraki University. Series A, Mathematics
1972English

O1-Convergence in Partially Ordered Sets

Journal of Nonlinear Science and Applications
Number TheoryAnalysisAlgebra
2019English

Shellable and Cohen-Macaulay Partially Ordered Sets

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1980English

Linear Extensions of Partially Ordered Sets.

English

Completeness and Compact Generation in Partially Ordered Sets

Journal of Mathematics and Computer Science
Computational MechanicsComputational MathematicsComputer Science ApplicationsMathematics
2016English

On Partially Ordered Sets Possessing a Unique Order-Compatible Topology

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1960English

Limit-Preserving Embeddings of Partially Ordered Sets in Directed Sets

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1956English

A Conjecture of Ore on Chains in Partially Ordered Sets

Bulletin of the American Mathematical Society
1943English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy