Robust k-Center with Two Types of Radii

von Chakrabarty, Deeparnab
Veröffentlicht in IPCO (22. : 2021 : Online) Integer programming and combinatorial optimization (2021)

Better Algorithms for Individually Fair k-Clustering

von Negahbani, Maryam
Veröffentlicht in NeurIPS (35. : 2021 : Online) 35th Conference on Neural Information Processing Systems (NeurIPS 2021) ; Volume 16 of 36 (2022)

Facility location with client latencies : LP-based techniques for minimum-latency problems

von Chakrabarty, Deeparnab
Veröffentlicht in Mathematics of operations research (2016)

On competitiveness in uniform utility allocation markets

von Chakrabarty, Deeparnab
Veröffentlicht in Internet and network economics (2007)

On competitiveness in uniform utility allocation markets

von Chakrabarty, Deeparnab
Veröffentlicht in Operations research letters (2009)

Integrality gap of the hypergraphic relaxation of Steiner trees : a short proof of a 1.55 upper bound

von Chakrabarty, Deeparnab
Veröffentlicht in Operations research letters (2010)

Public advertisement broker markets

von Sarma, Atish Das
Veröffentlicht in Internet and network economics (2007)

Budget constrained bidding in keyword auctions and online knapsack problems

von Zhou, Yunhong
Veröffentlicht in Internet and network economics (2008)

FAIR ALGORITHMS FOR CLUSTERING

von Bera, Suman
Veröffentlicht in NeurIPS (33. : 2019 : Vancouver, British Columbia) 32nd Conference on Neural Information Processing Systems (NeurIPS 2019) ; Volume 7 of 20 (2020)

Efficiency, fairness and competitiveness in Nash bargaining games

Veröffentlicht in Internet and network economics (2008)