×

Found 94 Documents (Results 1–94)

100
MathJax

Non-submodular streaming maximization with minimum memory and low adaptive complexity. (English) Zbl 1485.90112

Zhang, Zhao (ed.) et al., Algorithmic aspects in information and management. 14th international conference, AAIM 2020, Jinhua, China, August 10–12, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12290, 214-224 (2020).
MSC:  90C27 68W27
PDF BibTeX XML Cite
Full Text: DOI

Fast algorithms for maximizing monotone nonsubmodular functions. (English) Zbl 1485.90114

Zhang, Zhao (ed.) et al., Algorithmic aspects in information and management. 14th international conference, AAIM 2020, Jinhua, China, August 10–12, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12290, 204-213 (2020).
MSC:  90C27 90C59 68W25
PDF BibTeX XML Cite
Full Text: DOI

Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint. (English) Zbl 1485.90105

Zhang, Zhao (ed.) et al., Algorithmic aspects in information and management. 14th international conference, AAIM 2020, Jinhua, China, August 10–12, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12290, 195-203 (2020).
MSC:  90C27 68W10
PDF BibTeX XML Cite
Full Text: DOI

Convergence analysis of penalty decomposition algorithm for cardinality constrained convex optimization in Hilbert spaces. (English) Zbl 1464.90061

Kononov, Alexander (ed.) et al., Mathematical optimization theory and operations research. 19th international conference, MOTOR 2020, Novosibirsk, Russia, July 6–10, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12095, 141-153 (2020).
MSC:  90C25 90C48
PDF BibTeX XML Cite
Full Text: DOI

General bounds for incremental maximization. (English) Zbl 1455.90154

Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 43, 14 p. (2017).
MSC:  90C59
PDF BibTeX XML Cite
Full Text: DOI arXiv

A lower bound on CNF encodings of the at-most-one constraint. (English) Zbl 1417.68198

Gaspers, Serge (ed.) et al., Theory and applications of satisfiability testing – SAT 2017. 20th international conference, Melbourne, VIC, Australia, August 28 – September 1, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10491, 412-428 (2017).
MSC:  68T20 68Q17
PDF BibTeX XML Cite
Full Text: DOI arXiv

Committee selection with a weight constraint based on a pairwise dominance relation. (English) Zbl 1233.90237

Brafman, Ronen I. (ed.) et al., Algorithmic decision theory. Second international conference, ADT 2011, Piscataway, NJ, USA, October 26–28, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24872-6/pbk). Lecture Notes in Computer Science 6992. Lecture Notes in Artificial Intelligence, 28-41 (2011).
MSC:  90C27 90C29 90C57
PDF BibTeX XML Cite
Full Text: DOI HAL

Cardinality constraints in disjunctive deductive databases. (English) Zbl 1017.68043

Bertossi, Leopoldo (ed.) et al., Semantics in databases. Second international workshop, Dagstuhl Castle, Germany, January 7-12, 2001. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 2582, 179-199 (2003).
MSC:  68P15 68N17
PDF BibTeX XML Cite
Full Text: Link

On-line algorithms for cardinality constrained bin packing problems. (English) Zbl 1077.68954

Eades, Peter (ed.) et al., Algorithms and computation. 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 19–21, 2001. Proceedings. Berlin: Springer (ISBN 3-540-42985-9). Lect. Notes Comput. Sci. 2223, 695-706 (2001).
MSC:  68W25 90C27 90C59
PDF BibTeX XML Cite
Full Text: Link

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Year of Publication

all top 3

Classification