„Algorithms & Data Structures“

Suchergebnisse

3.154 Treffer

• Efficient construction of a bounded-degree spanner with low weight
  Arya, S. ; Smid, M.
• Improved bounds for electing a leader in a synchronous ring
  Overmars, M. ; Santoro, N.
• Improved approximation algorithms for MAXk-CUT and MAX BISECTION
  Frieze, A. ; Jerrum, M.
• “The big sweep”: On the power of the wavefront approach to Voronoi diagrams
  Dehne, F. ; Klein, R.
• Randomized approximation of bounded multicovering problems
  Peleg, D. ; Schechtman, G. ; Wool, A.
• Optimal parallel verification of minimum spanning trees in logarithmic time
  Dixon, B. ; Tarjan, R. E.
• Sorting helps for voronoi diagrams
  Chew, L. P. ; Fortune, S.
• Wenn der Computer zum Künstler wird – Wie Big Data und KI die Musik-, Literatur-, Kunst- und Entertainmentbranche revolutionieren
  Liegmal, Mathias 2020 REDLINE Verlag
• An approximation algorithm for minimum-cost vertex-connectivity problems
  Ravi, R. ; Williamson, D. P.
• An algorithm reminiscent of euclidean-gcd for computing a function related to pinwheel scheduling
  Romer, T. H. ; Rosier, L. E.
• k best cuts for circular-arc graphs
  Tsai, K. H. ; Lee, D. T.
• Primal-dual approximation algorithms for integral flow and multicut in trees
  Garg, N. ; Vazirani, V. V. ; Yannakakis, M.
• Time-optimal trajectories of a rod in the plane subject to velocity constraints
  Chen, Yui-Bin ; Ierardi, D.
• Guest editor’s foreword
  Goemans, M. X.
• Randomized quickhull
  Wenger, R.
• Three-dimensional graph drawing
  Cohen, R. F. ; Eades, P. ; Lin, Tao ; Ruskey, F.
• The complexity of almost-optimal simultaneous coordination
  Bazzi, R. A. ; Neiger, G.
• Arbres pour l’Algorithmique
  Chauvin, Brigitte ; Clement, Julien ; Gardy, Danièle 2018 Springer International Publishing
• Data structures and algorithms – a first course
  Adamson, Iain T. 1996 Springer
• Probabilistic Data Structures and Algorithms for Big Data Applications
  Gakhov, Andrii 2019 Books on Demand