Browsing Department of Mathematics by Subject "Korte-Lovasz constraints"
Now showing items 1-1 of 1
-
Greedy and Optimal Paths in a Weighted Graph Without Circuits and Applications to a Class of Optimization Problems on Finite Posets
(University of Texas at ArlingtonDepartment of Mathematics, 1983-05)**Please note that the full text is embargoed** ABSTRACT: In several recent papers B. Korte and L. Lovasz considered a mathematical structure called a simple language on which a greedy algorithm can operate (see [31,J41, ...