×

Found 4 Documents (Results 1–4)

Competitive-ratio approximation schemes for makespan scheduling problems. (English) Zbl 1395.68343

Erlebach, Thomas (ed.) et al., Approximation and online algorithms. 10th international workshop, WAOA 2012, Ljubljana, Slovenia, September 13–14, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-38015-0/pbk). Lecture Notes in Computer Science 7846, 159-172 (2013).
MSC:  68W27 68W25 90B35
PDFBibTeX XMLCite
Full Text: DOI

Constrained matching problems in bipartite graphs. (English) Zbl 1370.05172

Mahjoub, A. Ridha (ed.) et al., Combinatorial optimization. Second international symposium, ISCO 2012, Athens, Greece, April 19-21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-32146-7/pbk). Lecture Notes in Computer Science 7422, 344-355 (2012).
PDFBibTeX XMLCite
Full Text: DOI

Restricted max-min fair allocations with inclusion-free intervals. (English) Zbl 1364.68370

Gudmundsson, Joachim (ed.) et al., Computing and combinatorics. 18th annual international conference, COCOON 2012, Sydney, Australia, August 20–22, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32240-2/pbk). Lecture Notes in Computer Science 7434, 98-108 (2012).
MSC:  68W25 91B32
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Year of Publication

all top 3

Main Field