„Submodular“

Suchergebnisse

1.000+ Treffer

• A submodular network simplex method
  Barahona, Francisco ; Cunningham, William H. 1983 Inst. für Ökonometrie u. Operations-Research
• Submodular Minimization Under Congruency Constraints
  Nägele, Martin ; Sudakov, Benny ; Zenklusen, Rico
• Streaming algorithms for non-monotone DR-submodular maximization under a knapsack constraint on the integer lattice
  Zhang, Hongyang ; Luo, Wenchang
• The Ground-Set-Cost Budgeted Maximum Coverage Problem
  van Heuven van Staereling, Irving ; Keijzer, Bart ˜deœ ; Schäfer, Guido 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Splitting-Off in Hypergraphs
  Bérczi, Kristóf ; Chandrasekaran, Karthekeyan ; Király, Tamás ; Kulkarni, Shubhang 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Correction to: Submodular financial markets with frictions
  Chateauneuf, Alain ; Cornet, Bernard
• Hypergraph Connectivity Augmentation in Strongly Polynomial Time
  Bérczi, Kristóf ; Chandrasekaran, Karthekeyan ; Király, Tamás ; Kulkarni, Shubhang 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Monotone submodular subset for sentiment analysis of online reviews
  Zhao, Yang ; Chow, Tommy W. S.
• Bipolar behavior of submodular, law-invariant capacities
  Amarante, Massimiliano
• Nonnegative definite hermitian matrices with increasing principal minors
  Friedland, Shmuel
• Algorithmic information and complexity – on additivity, submodularity and ingleton's inequality
  Hammer, Daniel 1995 TU, Fachbereich 3
• Submodular flow problem with a nonseparable cost function
  Murota, Kazuo 1995 Sonderforschungsbereich 303
• Submodular flow problem with a nonseparable cost function
  Murota, Kazuo 1995 Forschungsinst. für Diskrete Mathematik
• Tangles, Trees of Tangles, and Submodularity
  Teegen, Maximilian 2021 Staats- und Universitätsbibliothek Hamburg Carl von Ossietzky
• Flows over time and submodular function minimization
  Schlöter, Miriam ; Skutella, Martin ; Peis, Britta ; McCormick, Thomas 2018 Technische Universität Berlin
• Finding Small Dijoins in Transitive Closure Time
  Nalam, Chaitanya ; Saranurak, Thatchaphol 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A direct proof of the characterization of the convexity of the discrete Choquet integral
  Alcantud, José Carlos R.
• Finding Diverse Solutions in Combinatorial Problems with a Distributive Lattice Structure
  de Berg, Mark ; López Martínez, Andrés ; Spieksma, Frits C. R. 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Algorithm engineering for generic subset optimization problems
  Woydt, Henning ; Sommer, Frank ; Komusiewicz, Christian 2024 Friedrich-Schiller-Universität Jena
• Algorithms and complexity results for submodular function maximization, traveling salesman and other graph design problems
  Gottschalk, Corinna ; Peis, Britta ; Koster, Arie Marinus 2017 Universitätsbibliothek der RWTH Aachen