„algorithm complexity“

Suchergebnisse

4.228 Treffer

• Correction to: A solution algorithm for integrated production-inventory-routing of perishable goods with transshipment and uncertain demand
  Liu, Peide ; Hendalianpour, Ayad ; Razmi, Jafar ; Sangari, Mohamad Sadegh
• Parameterized Aspects of Strong Subgraph Closure
  Golovach, Petr A. ; Heggernes, Pinar ; Konstantinidis, Athanasios L. ; Lima, Paloma T. ; Papadopoulos, Charis
• Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds
  Bansal, Nikhil ; Oosterwijk, Tim ; Vredeveld, Tjark ; Zwaan, Ruben van der
• Scheduling (Dagstuhl Seminar 25121)
  Mathieu, Claire ; Megow, Nicole ; Moseley, Benjamin J. ; Spieksma, Frits C. R. ; Lindermayr, Alexander
• Diversity of Answers to Conjunctive Queries
  Merkl, Timo Camillo ; Pichler, Reinhard ; Skritek, Sebastian 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments
  Bang-Jensen, Jørgen ; Maddaloni, Alessandro ; Saurabh, Saket
• Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures
  Nardelli, Enrico ; Proietti, Guido ; Widmayer, Peter
• Optimization with Demand Oracles
  Badanidiyuru, Ashwinkumar ; Dobzinski, Shahar ; Oren, Sigal
• Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ Pt -Free and Broom-Free Graphs
  Bacsó, Gábor ; Lokshtanov, Daniel ; Marx, Dániel ; Pilipczuk, Marcin ; Tuza, Zsolt ; van Leeuwen, Erik Jan
• Extending Convex Partial Drawings of Graphs
  Mchedlidze, Tamara ; Nöllenburg, Martin ; Rutter, Ignaz
• Parameterized Complexity of Directed Spanner Problems
  Fomin, Fedor V. ; Golovach, Petr A. ; Lochet, William ; Misra, Pranabendu ; Saurabh, Saket ; Sharma, Roohani
• The Price of Optimum: Complexity and Approximation for a Matching Game
  Escoffier, Bruno ; Gourvès, Laurent ; Monnot, Jérôme
• Multi-sided Boundary Labeling
  Kindermann, Philipp ; Niedermann, Benjamin ; Rutter, Ignaz ; Schaefer, Marcus ; Schulz, André ; Wolff, Alexander
• Binary Pattern Tile Set Synthesis Is NP-Hard
  Kari, Lila ; Kopecki, Steffen ; Meunier, Pierre-Étienne ; Patitz, Matthew J. ; Seki, Shinnosuke
• Algorithms and computation – 6th international workshop ; proceedings
  Rahman, Md. Saidur ; Nakano, Shin-ichi 2012 Springer
• Algorithms and Complexity on Indexing Elastic Founder Graphs
  Equi, Massimo ; Norri, Tuukka ; Alanko, Jarno ; Cazaux, Bastien ; Tomescu, Alexandru I. ; Mäkinen, Veli 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Efficiency of All-Pay Mechanisms
  Christodoulou, Giorgos ; Sgouritsa, Alkmini ; Tang, Bo
• 2-Xor Revisited: Satisfiability and Probabilities of Functions
  Panafieu, Élie de ; Gardy, Danièle ; Gittenberger, Bernhard ; Kuba, Markus
• Netzbasierte Ansätze zur natürlichsprachlichen Informationsverarbeitung
  Unger, Herwig ; Kubek, Mario ; Sukjit, Panchalee 2022 Springer Fachmedien Wiesbaden
• Optimal decentralized distributed algorithms for stochastic convex optimization
  Gorbunov, Eduard ; Dvinskikh, Darina ; Gasnikov, Alexander 2020 Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik