File Download
Supplementary

Conference Paper: Online algorithms for covering and packing problems with convex objectives

TitleOnline algorithms for covering and packing problems with convex objectives
Authors
KeywordsOnline algorithm
Convex optimization
Primaldual algorithm
Issue Date2016
PublisherIEEE.
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?
AbstractWe present online algorithms for covering and packing problems with (non-linear) convex objectives. The convex covering problem is defined as ...
Persistent Identifierhttp://hdl.handle.net/10722/232177

 

DC FieldValueLanguage
dc.contributor.authorAzar, Y-
dc.contributor.authorBuchbinder, N-
dc.contributor.authorChan, HTH-
dc.contributor.authorChen, S-
dc.contributor.authorCohen, IR-
dc.contributor.authorGupta, A-
dc.contributor.authorHuang, Z-
dc.contributor.authorKang, N-
dc.contributor.authorNagarjajan, V-
dc.contributor.authorNaor, JS-
dc.contributor.authorPanigrahi, D-
dc.date.accessioned2016-09-20T05:28:15Z-
dc.date.available2016-09-20T05:28:15Z-
dc.date.issued2016-
dc.identifier.citationThe 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.urihttp://hdl.handle.net/10722/232177-
dc.description.abstractWe present online algorithms for covering and packing problems with (non-linear) convex objectives. The convex covering problem is defined as ...-
dc.languageeng-
dc.publisherIEEE.-
dc.relation.ispartofIEEE Annual Symposium on Foundations of Computer Science (FOCS) Proceedings-
dc.rightsIEEE 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.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectOnline algorithm-
dc.subjectConvex optimization-
dc.subjectPrimaldual algorithm-
dc.titleOnline algorithms for covering and packing problems with convex objectives-
dc.typeConference_Paper-
dc.identifier.emailChan, HTH: hubert@cs.hku.hk-
dc.identifier.emailHuang, Z: zhiyi@cs.hku.hk-
dc.identifier.authorityChan, HTH=rp01312-
dc.identifier.authorityHuang, Z=rp01804-
dc.description.naturepostprint-
dc.identifier.hkuros264467-
dc.identifier.spage1-
dc.identifier.epage10-
dc.publisher.placeUnited States-
dc.customcontrol.immutablesml 161003-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats