×

Found 27 Documents (Results 1–27)

Faster algorithms for \(k\)-Subset Sum and variations. (English) Zbl 07724804

Chen, Jing (ed.) et al., Frontiers of algorithmics. International joint conference, IJTCS-FAW 2021, Beijing, China, August 16–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12874, 37-52 (2022).
MSC:  90C27 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Online knapsack problem with removal cost. (English) Zbl 1364.68374

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, 61-73 (2012).
MSC:  68W27 68W40 90C27
PDFBibTeX XMLCite
Full Text: DOI

Motion planning with pulley, rope, and baskets. (English) Zbl 1245.68104

Dürr, Christoph (ed.) et al., STACS 2012. 29th international symposium on theoretical aspects of computer science, Paris, France, February 29th – March 3rd, 2012. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-35-4). LIPIcs – Leibniz International Proceedings in Informatics 14, 374-383, electronic only (2012).
MSC:  68Q25 90B35 68M20
PDFBibTeX XMLCite
Full Text: DOI

A fast approximation scheme for the multiple knapsack problem. (English) Zbl 1302.90183

Bieliková, Mária (ed.) et al., SOFSEM 2012: Theory and practice of computer science. 38th conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 21–27, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-27659-0/pbk). Lecture Notes in Computer Science 7147, 313-324 (2012).
PDFBibTeX XMLCite
Full Text: DOI Link

Committee selection with a weight constraint based on lexicographic rankings of individuals. (English) Zbl 1260.91087

Rossi, Francesca (ed.) et al., Algorithmic decision theory. First international conference, ADT 2009, Venice, Italy, October 20–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04427-4/pbk). Lecture Notes in Computer Science 5783. Lecture Notes in Artificial Intelligence, 50-61 (2009).
PDFBibTeX XMLCite
Full Text: DOI

Complexity theory and cryptology. An introduction to cryptocomplexity. (Komplexitätstheorie und Kryptologie. Eine Einführung in Kryptokomplexität.) (German) Zbl 1171.68008

eXamen.press. Berlin: Springer (ISBN 978-3-540-79744-9/hbk). xi, 535 p. (2008).
PDFBibTeX XMLCite
Full Text: DOI

Approximation algorithms for 3D orthogonal Knapsack. (English) Zbl 1198.68299

Cai, Jin-Yi (ed.) et al., Theory and applications of models of computation. 4th international conference, TAMC 2007, Shanghai, China, May 22–25, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72503-9/pbk). Lecture Notes in Computer Science 4484, 34-45 (2007).
MSC:  68W25 68Q25 90C27
PDFBibTeX XMLCite
Full Text: DOI

Improved multi-unit auction clearing algorithms with interval (multiple-choice) knapsack problems. (English) Zbl 1135.90394

Asano, Tetsuo (ed.), Algorithms and computation. 17th international symposium, ISAAC 2006, Kolkata, India, December 18–20, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-49694-6/pbk). Lecture Notes in Computer Science 4288, 494-506 (2006).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software