File Download
Supplementary
-
Citations:
- Appears in Collections:
Conference Paper: Online algorithms for covering and packing problems with convex objectives
| Title | Online algorithms for covering and packing problems with convex objectives |
|---|---|
| Authors | |
| Keywords | Online algorithm Convex optimization Primaldual algorithm |
| Issue Date | 2016 |
| Publisher | IEEE. |
| Citation | The 57th IEEE Annual Symposium on Foundations of Computer Science (FOCS 2016), New Brunswick, NJ., 9-11 October 2016. In Conference Proceedings, 2016, p. 1-10 How to Cite? |
| Abstract | We present online algorithms for covering and packing problems with (non-linear) convex objectives. The convex covering problem is defined as ... |
| Persistent Identifier | http://hdl.handle.net/10722/232177 |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Azar, Y | - |
| dc.contributor.author | Buchbinder, N | - |
| dc.contributor.author | Chan, HTH | - |
| dc.contributor.author | Chen, S | - |
| dc.contributor.author | Cohen, IR | - |
| dc.contributor.author | Gupta, A | - |
| dc.contributor.author | Huang, Z | - |
| dc.contributor.author | Kang, N | - |
| dc.contributor.author | Nagarjajan, V | - |
| dc.contributor.author | Naor, JS | - |
| dc.contributor.author | Panigrahi, D | - |
| dc.date.accessioned | 2016-09-20T05:28:15Z | - |
| dc.date.available | 2016-09-20T05:28:15Z | - |
| dc.date.issued | 2016 | - |
| dc.identifier.citation | The 57th IEEE Annual Symposium on Foundations of Computer Science (FOCS 2016), New Brunswick, NJ., 9-11 October 2016. In Conference Proceedings, 2016, p. 1-10 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/232177 | - |
| dc.description.abstract | We present online algorithms for covering and packing problems with (non-linear) convex objectives. The convex covering problem is defined as ... | - |
| dc.language | eng | - |
| dc.publisher | IEEE. | - |
| dc.relation.ispartof | IEEE Annual Symposium on Foundations of Computer Science (FOCS) Proceedings | - |
| dc.rights | IEEE Annual Symposium on Foundations of Computer Science (FOCS) Proceedings. Copyright © IEEE. | - |
| dc.rights | ©2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. | - |
| dc.subject | Online algorithm | - |
| dc.subject | Convex optimization | - |
| dc.subject | Primaldual algorithm | - |
| dc.title | Online algorithms for covering and packing problems with convex objectives | - |
| dc.type | Conference_Paper | - |
| dc.identifier.email | Chan, HTH: hubert@cs.hku.hk | - |
| dc.identifier.email | Huang, Z: zhiyi@cs.hku.hk | - |
| dc.identifier.authority | Chan, HTH=rp01312 | - |
| dc.identifier.authority | Huang, Z=rp01804 | - |
| dc.description.nature | postprint | - |
| dc.identifier.hkuros | 264467 | - |
| dc.identifier.spage | 1 | - |
| dc.identifier.epage | 10 | - |
| dc.publisher.place | United States | - |
| dc.customcontrol.immutable | sml 161003 | - |