Online knapsack problem and budgeted truthful bipartite matching

Rahul Vaze. Online knapsack problem and budgeted truthful bipartite matching. In 2017 IEEE Conference on Computer Communications, INFOCOM 2017, Atlanta, GA, USA, May 1-4, 2017. pages 1-9, IEEE, 2017. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.