„Matroid algorithms“

Suchergebnisse

83 Treffer

• Towards Nearly-Linear Time Algorithms for Submodular Maximization with a Matroid Constraint
  Ene, Alina ; Nguyen, Huy L. 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs
  Chalermsook, Parinya ; Schmid, Andreas ; Uniyal, Sumedha 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Combinatorial Secretary Problems with Ordinal Information
  Hoefer, Martin ; Kodric, Bojana 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs
  Ahmadian, Sara ; Friggstad, Zachary 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Correlated Rounding of Multiple Uniform Matroids and Multi-Label Classification
  Chen, Shahar ; Di Castro, Dotan ; Karnin, Zohar ; Lewin-Eytan, Liane ; Naor, Joseph (Seffi) ; Schwartz, Roy 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• House Markets with Matroid and Knapsack Constraints
  Krysta, Piotr ; Zhang, Jinshan 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Returning Secretary
  Vardi, Shai 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications
  Swamy, Chaitanya 2014 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Submodular Stochastic Probing on Matroids
  Adamczyk, Marek ; Sviridenko, Maxim ; Ward, Justin 2014 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Knapsack Cover Subject to a Matroid Constraint
  Chakaravarthy, Venkatesan T. ; Choudhury, Anamitra Roy ; Natarajan, Sivaramakrishnan R. ; Roy, Sambuddha 2013 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Density Functions subject to a Co-Matroid Constraint
  Chakaravarthy, Venkatesan T. ; Modani, Natwar ; Natarajan, Sivaramakrishnan R. ; Roy, Sambuddha ; Sabharwal, Yogish 2012 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Power of Local Search: Maximum Coverage over a Matroid
  Filmus, Yuval ; Ward, Justin 2012 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Combinatorial Optimization – Theory and Algorithms
  Korte, Bernhard ; Vygen, Jens 2018 Springer Berlin
• Two algorithms for weighted matroid intersection
  Brezovec, Carl ; Cornuéjols, Gérard ; Glover, Fred
• Parameterized Algorithms
  2015 Springer International Publishing
• Combinatorial Optimization – Theory and Algorithms
  Korte, Bernhard ; Vygen, Jens 2000 Springer Berlin Heidelberg
• Semi-streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints
  Huang, Chien-Chung ; Sellier, François
• Matroid intersection algorithms
  Lawler, Eugene L.
• New algorithms for lineark-matroid intersection and matroidk-parity problems
  Barvinok, Alexander I.
• Matroid optimization and algorithms
  Bixby, Robert E. ; Cunningham, William H. 1990 Inst. für Ökonometrie und Operations-Research