Pages that link to "Item:Q5492894"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2005 (Q5492894):
Displaying 7 items.
- Combinatorial auctions without money (Q521808) (← links)
- Approximation algorithm for the multicovering problem (Q2025081) (← links)
- Approximation of set multi-cover via hypergraph matching (Q2207501) (← links)
- Combinatorial auctions with verification are tractable (Q2512655) (← links)
- Iterative Packing for Demand and Hypergraph Matching (Q3009775) (← links)
- Inapproximability of b-Matching in k-Uniform Hypergraphs (Q3078381) (← links)
- (Q4252388) (← links)