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]
@inproceedings{Vaze17,
title = {Online knapsack problem and budgeted truthful bipartite matching},
author = {Rahul Vaze},
year = {2017},
doi = {10.1109/INFOCOM.2017.8057223},
url = {https://doi.org/10.1109/INFOCOM.2017.8057223},
researchr = {https://researchr.org/publication/Vaze17},
cites = {0},
citedby = {0},
pages = {1-9},
booktitle = {2017 IEEE Conference on Computer Communications, INFOCOM 2017, Atlanta, GA, USA, May 1-4, 2017},
publisher = {IEEE},
isbn = {978-1-5090-5336-0},
}