„approximation“

Suchergebnisse

10.000+ Treffer

• Near Optimal Locality Sensitive Orderings in Euclidean Space
  Gao, Zhimeng ; Har-Peled, Sariel 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically
  Buchem, Moritz ; Deuker, Paul ; Wiese, Andreas 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Braess, D., Nonlinear Approximation Theory. Berlin etc., Springer‐Verlag 1986. XIV, 290 S., 38 Abb., DM 148,—. ISBN 3‐540‐13625‐8 (Springer Series in Computational Mathematics 7)
  Mühlig, H.
• Approximating Densest Subgraph in Geometric Intersection Graphs
  Har-Peled, Sariel ; Rahul, Saladi 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Computing Instance-Optimal Kernels in Two Dimensions
  Agarwal, Pankaj K. ; Har-Peled, Sariel 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Bultheel, A. Dewilde, P. (eds.), Rational Approximation in Systems Engineering. Boston‐Basel‐Stuttgart, Birkhäuser 1983. Reprinted from Circuits, Systems, and Signal Processing. Vol. 1, Number 3–4, 1982, VII, 236 S., sFr. 72.—. ISBN 3‐7643‐3159‐3
  Kuhnert, F.
• Alexits, G., Approximation Theory. Selected Papers. Ed. by Tandori, K., Budapest, Akadémiai Kiadó 1983. 297 S., Ft 330,—. ISBN 963‐05‐3204‐2
  Kuhnert, F.
• Meinardus, G.; Nürnberger, G. (eds.), Delay Equations, Approximation and Application. Proceedings, Mannheim 1984. Basel‐Boston‐Stuttgart, Birkhäuser 1985. 351 S., sFr. 78.00. ISBN 3‐7643‐1733‐7 (ISNM 74)
  Grund, F.
• Butzer, P. L.; Stens, R. L.; Sz.‐Nagy, B. (eds.), Anniversary Volume on Approximation Theory and Functional Analysis. Proceedings, Oberwolfach 1983. Basel‐Boston‐Stuttgart, Birkhäuser 1984. 635 S., sFr. 88.00. ISBN 3‐7643‐1574‐1 (ISNM 65)
  Porath, G.
• Schempp, W.; Zeller, K. (eds.), Multivariate Approximation Theory III. Proceedings, Oberwolfach 1985. Basel‐Boston‐Stuttgart, Birkhäuser 1985. 400 S., sFr. 84.00. ISBN 3‐7643‐1738‐8 (ISNM 75)
  Schwetlick, H.
• Tight Approximation Algorithms for Two-Dimensional Guillotine Strip Packing
  Khan, Arindam ; Lonkar, Aditya ; Maiti, Arnab ; Sharma, Amatya ; Wiese, Andreas 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Strong Approximations and Irrationality in Financial Networks with Derivatives
  Ioannidis, Stavros D. ; Keijzer, Bart ˜deœ ; Ventre, Carmine 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximation Algorithms for Maximum Matchings in Geometric Intersection Graphs
  Har-Peled, Sariel ; Yang, Everett 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time
  Eberle, Franziska ; Megow, Nicole ; Nölke, Lukas ; Simon, Bertrand ; Wiese, Andreas 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Improved Approximation Algorithms for Tverberg Partitions
  Har-Peled, Sariel ; Zhou, Timothy 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Computing Maximum Matchings in Temporal Graphs
  Mertzios, George B. ; Molter, Hendrik ; Niedermeier, Rolf ; Zamaraev, Viktor ; Zschoche, Philipp 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Exact and approximation algorithms for routing a convoy through a graph
  Ee, Martijn ˜vanœ ; Oosterwijk, Tim ; Sitters, René ; Wiese, Andreas
• New Lower Bounds for the Integration of Periodic Functions
  Krieg, David ; Vybíral, Jan
• Optimization of friction stir welding processes using multi-attributive border approximation area comparison (MABAC) method in neutrosophic fuzzy environment
  Chatterjee, Srinjoy ; Chakraborty, Shankar
• Global Operator Calculus on Spin Groups
  Cerejeiras, Paula ; Ferreira, M. ; Kähler, Uwe ; Wirth, Jens