Algorithms and Data Structures

From MaRDI portal

Revision as of 01:23, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5900759

Jump to:navigation, search

DOI10.1007/B11837zbMath1253.68378MaRDI QIDQ5900759

Shang-Hua Teng, Daniel A. Spielman

Publication date: 20 April 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (11)

Smoothed analysis of binary search trees ⋮ The Complexity of Problems in P Given Correlated Instances ⋮ The diameter of randomly perturbed digraphs and some applications ⋮ Smoothed analysis of condition numbers and complexity implications for linear programming ⋮ Why Greed Works for Shortest Common Superstring Problem ⋮ Around the circular law ⋮ On realistic terrains ⋮ On percolation and ‐hardness ⋮ Performance guarantees for scheduling algorithms under perturbed machine speeds ⋮ Why greed works for shortest common superstring problem ⋮ Hamiltonicity in randomly perturbed hypergraphs

This page was built for publication: Algorithms and Data Structures

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5900759&oldid=16938883"