„Approximation Algorithm“

Suchergebnisse

2.890 Treffer

• On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree
  Feldmann, Andreas Emil ; Könemann, Jochen ; Olver, Neil ; Sanità, Laura 2014 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Packing a Knapsack of Unknown Capacity
  Disser, Yann ; Klimm, Max ; Megow, Nicole ; Stiller, Sebastian 2014 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241)
  Dyer, Martin ; Feige, Uriel ; Frieze, Alan M. ; Karpinski, Marek
• Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks
  Abu-Khzam, Faisal N. ; Markarian, Christine ; Meyer auf der Heide, Friedhelm ; Schubert, Michael
• Matching and Edge Cover in Temporal Graphs
  Cioni, Lapo ; Dondi, Riccardo ; Marino, Andrea ; Schoeters, Jason ; Silva, Ana 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Group Fairness and Multi-Criteria Optimization in School Assignment
  K. A., Santhini ; Munagala, Kamesh ; Nasre, Meghana ; S. Sankar, Govind 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Hardness and Approximation Algorithms for Balanced Districting Problems
  Dharangutte, Prathamesh ; Gao, Jie ; Huang, Shang-En ; Yu, Fang-Yi 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond
  Chakraborty, Dibyayan ; Dailly, Antoine ; Das, Sandip ; Foucaud, Florent ; Gahlawat, Harmender ; Ghosh, Subir Kumar 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Computing Opaque Interior Barriers à la Shermer
  Dumitrescu, Adrian ; Jiang, Minghui ; Tóth, Csaba D. 2014 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems
  Van Bevern, René ; Komusiewicz, Christian ; Sorge, Manuel 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A self adaptive inertial subgradient extragradient algorithm for variational inequality and common fixed point of multivalued mappings in Hilbert spaces
  Jolaoso, Lateef Olakunle ; Taiwo, Adeolu ; Alakoya, Timilehin Opeyemi ; Mewomo, Oluwatosin
• A Unified Algorithm for Solving Split Generalized Mixed Equilibrium Problem, and for Finding Fixed Point of Nonspreading Mapping in Hilbert Spaces
  Jolaoso, Lateef Olakunle ; Oyewole, Kazeem Olawale ; Okeke, Chibueze Christian ; Mewomo, Oluwatosin
• Polynomial-Time Approximation Schemes for Circle and Other Packing Problems
  Miyazawa, Flávio Keidi ; Pedrosa, Lehilton L. C. ; Schouery, Rafael C. S. ; Sviridenko, Maxim ; Wakabayashi, Yoshiko
• Computation-Aware Data Aggregation
  Haeupler, Bernhard ; Hershkowitz, D. Ellis ; Kahng, Anson ; Procaccia, Ariel D. 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Collapsing Superstring Conjecture
  Golovnev, Alexander ; Kulikov, Alexander S. ; Logunov, Alexander ; Mihajlin, Ivan ; Nikolaev, Maksim 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Numerical Methods for Algorithmic Systems and Neural Networks
  Kinnewig, Sebastian ; Kolditz, Leon ; Roth, Julian ; Wick, Thomas 2025 Gottfried Wilhelm Leibniz Universität Hannover
• Direct Schur complement method by domain decomposition based on H-matrix approximation
  Hackbusch, Wolfgang ; Khoromskij, Boris N. ; Kriemann, Ronald
• Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing
  Gong, Mingyang ; Goebel, Randy ; Lin, Guohui ; Miyano, Eiji
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)
  Wootters, Mary ; Sanità, Laura 2021 Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH
• New approximation algorithms for machine scheduling with rejection on single and parallel machine
  Liu, Peihai ; Lu, Xiwen