A Combinatorial Abstraction of One Shortest Path Problem and Its Relationship to Greedoids

Simple item page
dc.contributor.authorBoyd, E. Andrew
dc.date.accessioned2018-06-18T17:28:17Z
dc.date.available2018-06-18T17:28:17Z
dc.date.issued1988-05
dc.date.noteMay 1988
dc.description.abstractA natural generalization of the shortest path problem to arbitrary set systems is presented that captures a number of interesting problems, including the usual graph-theoretic shortest path problem and the problem of finding a minimum weight set on a matroid. Necessary and sufficient conditions for the solution of this problem by the greedy algorithm are then investigated. In particular, it is noted that it is necessary but not sufficient for the underlying combinatorial structure to be a greedoid, and the three extremely diverse collections of sufficient conditions taken from the greedoid literature are presented.
dc.format.extent30 pp
dc.identifier.citationBoyd, E. Andrew. "A Combinatorial Abstraction of One Shortest Path Problem and Its Relationship to Greedoids." (1988) <a href="https://hdl.handle.net/1911/101643">https://hdl.handle.net/1911/101643</a>.
dc.identifier.digitalTR88-07
dc.identifier.urihttps://hdl.handle.net/1911/101643
dc.language.isoeng
dc.titleA Combinatorial Abstraction of One Shortest Path Problem and Its Relationship to Greedoids
dc.typeTechnical report
dc.type.dcmiText
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR88-07.pdf
Size:
389.41 KB
Format:
Adobe Portable Document Format
Download
Collections
CAAM Technical Reports