„Matroid algorithms“

Suchergebnisse

1.000+ Treffer

• Correction to: A Connection Between Sports and Matroids: How Many Teams Can We Beat?
  Schlotter, Ildikó ; Cechlárová, Katarína
• Diverse Collections in Matroids and Graphs
  Fomin, Fedor V. ; Golovach, Petr A. ; Panolan, Fahad ; Philip, Geevarghese ; Saurabh, Saket 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Murota, K., Systems Analysis by Graphs and Matroids. Structural Solvability and Controllability. Berlin etc., Springer‐Verlag 1987. IX, 281 pp., 54 figs., DM 79,–. ISBN 3‐540‐17659‐4 (Algorithms and Combinatorics 3)
  Terno, J.
• Exact and approximation algorithms for weighted matroid intersection
  Huang, Chien-Chung ; Kakimura, Naonori ; Kamiyama, Naoyuki
• Budget Feasible Mechanisms on Matroids
  Leonardi, Stefano ; Monaco, Gianpiero ; Sankowski, Piotr ; Zhang, Qiang
• The algorithms for valuated delta-matroids
  Murota, Kazuo 1995 Forschungsinst. für Diskrete Mathematik
• The algorithms for valuated delta-matroids
  Murota, Kazuo 1995 Sonderforschungsbereich 303
• Evolutionary Algorithms and Matroid Optimization Problems
  Reichel, Joachim ; Skutella, Martin
• Exact and approximation algorithms for many-visits travelling salesperson problems
  Vincze, Roland ; Mnich, Matthias 2022 Universitätsbibliothek der Technischen Universität Hamburg
• Algorithmic Game Theory – 6th International Symposium, SAGT 2013, Aachen, Germany, October 21-23, 2013. Proceedings
  Lavi, Ron 2013 Springer Berlin Heidelberg
• Satisfiability Problems in Discrete Geometry
  Schewe, Lars 2007 Shaker
• Beating Competitive Ratio 4 for Graphic Matroid Secretary
  Banihashem, Kiarash ; Hajiaghayi, MohammadTaghi ; Kowalski, Dariusz R. ; Krysta, Piotr ; Mittal, Danny ; Olkowski, Jan 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Formal Analysis of Algorithms for Matroids and Greedoids
  Abdulaziz, Mohammad ; Ammer, Thomas ; Meenakshisundaram, Shriya ; Rimpapa, Adem 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Integer Programming and Combinatorial Optimization – 18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings
  Louveaux, Quentin ; Skutella, Martin 2016 Springer International Publishing
• Deterministic Constrained Multilinear Detection
  Brand, Cornelius ; Korchemna, Viktoriia ; Skotnica, Michael 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems
  Bilò, Vittorio ; Caragiannis, Ioannis ; Fanelli, Angelo ; Flammini, Michele ; Monaco, Gianpiero 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Fractional Linear Matroid Matching Is in Quasi-NC
  Gurjar, Rohit ; Oki, Taihei ; Raj, Roshan 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Local Optimization Algorithms for Maximum Planar Subgraph
  Călinescu, Gruia ; Uniyal, Sumedha 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges
  Merino, Arturo ; Mütze, Torsten ; Williams, Aaron 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Max-Sum Diversity Via Convex Programming
  Cevallos, Alfonso ; Eisenbrand, Friedrich ; Zenklusen, Rico 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik