Algorithms and Theory of Computation Handbook, Volume 2

DOI10.1201/9781584888215zbMath1193.68002OpenAlexW2482040973MaRDI QIDQ3654719

No author found.

Publication date: 8 January 2010

Full work available at URL: https://doi.org/10.1201/9781584888215

zbMATH Keywords

algorithmslinear programmingconvex programmingdata structuresgraph algorithmsrandomized algorithmssearching

Mathematics Subject Classification ID

Searching and sorting (68P10) Convex programming (90C25) Database theory (68P15) Nonnumerical algorithms (68W05) Computing methodologies for image processing (68U10) Linear programming (90C05) Network design and communication in computer systems (68M10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Collections of articles of miscellaneous specific interest (00B15) Parallel algorithms in computer science (68W10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Randomized algorithms (68W20) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00)

Related Items (3)

Drawing partial 2-trees with few slopes ⋮ Analyzing clustering and partitioning problems in selected VLSI models ⋮ Order-preserving pattern matching indeterminate strings

Uses Software

• JDQR
• EISPACK
• JDQZ

This page was built for publication: Algorithms and Theory of Computation Handbook, Volume 2