×

Found 45 Documents (Results 1–45)

Newest Citations Relevance
Albers, Susanne; Khan, Arindam; Ladewig, Leon

Improved online algorithms for knapsack and GAP in the random order model. (English) Zbl 1516.68122

Achlioptas, Dimitris (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques, 22nd international conference, APPROX 2019, and 23rd international conference, RANDOM 2019, Massachusetts Institute of Technology, Cambridge, MA, USA, September 20–22, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 145, Article 22, 23 p. (2019).
MSC:  68W27 68W20 90C27
Cite Review PDF
Full Text: DOI
Chan, T.-H. Hubert; Jiang, Shaofeng H.-C.; Tang, Zhihao Gavin; Wu, Xiaowei

Online submodular maximization problem with vector packing constraint. (English) Zbl 1442.68272

Pruhs, Kirk (ed.) et al., 25th European symposium on algorithms, ESA 2017, Vienna, Austria, September 4–6, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 87, Article 24, 14 p. (2017).
MSC:  68W27 90C27
Cite Review PDF
Full Text: DOI arXiv
Emek, Yuval; Halldórsson, Magnús M.; Mansour, Yishay; Patt-Shamir, Boaz; Radhakrishnan, Jaikumar; Rawitz, Dror

Online set packing and competitive scheduling of multi-part tasks. (English) Zbl 1315.68035

Proceedings of the 29th annual ACM SIGACT-SIGOPS symposium on principles of distributed computing, PODC ’10, Zurich, Switzerland, July 25–28, 2010. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-888-9). 440-449 (2010).
MSC:  68M20 68Q25 68W15 68W20 68W27
Cite Review PDF
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software