| Title: |
Online Algorithms for Covering and Packing Problems with Convex Objectives |
| Article URLs: |
|
| Alternative Article URLs: |
|
| Authors: |
Yossi Azar |
-
Tel Aviv University, Blavatnik School of Computer Science
|
| Niv Buchbinder |
-
Tel Aviv University, Department of Statistics and Operations Research
|
| T.-H. Hubert Chan |
-
The University of Hong Kong, Department of Computer Science
|
| Shahar Chen |
-
Technion - Israel Institute of Technology, Department of Computer Science
|
| Ilan Reuven Cohen |
-
Tel Aviv University, Department of Statistics and Operations Research
|
| Anupam Gupta |
-
Carnegie Mellon University, Department of Computer Science
|
| Zhiyi Huang |
-
The University of Hong Kong, Department of Computer Science
|
| Ning Kang |
-
The University of Hong Kong, Department of Computer Science
|
| Viswanath Nagarajan |
-
University of Michigan - Ann Arbor, Department of Industrial and Operations Engineering
|
| Joseph Naor |
-
Technion - Israel Institute of Technology, Department of Computer Science
|
| Debmalya Panigrahi |
-
Duke University, Department of Computer Science
|
| Sharing: |
Unknown
|
| Verification: |
Authors have
not verified
information
|
| Artifact Evaluation Badge: |
none
|
| Artifact URLs: |
|
| Artifact Correspondence Email Addresses: |
|
| NSF Award Numbers: |
1319811,
1536002,
1540541,
1617790,
1527084,
1535972
|
| DBLP Key: |
conf/focs/AzarBCCCG0KNNP16
|
| Author Comments: |
|