Pages that link to "Item:Q5091242"
From MaRDI portal
The following pages link to The Minimum Cost Query Problem on Matroids with Uncertainty Areas. (Q5091242):
Displaying 3 items.
- Round-competitive algorithms for uncertainty problems with parallel queries (Q2684483) (← links)
- Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty (Q6196899) (← links)
- On the enumeration of non-dominated matroids with imprecise weights (Q6638831) (← links)
