scientific article; zbMATH DE number 7646025
From MaRDI portal
Publication:5871911
zbMath1503.68002MaRDI QIDQ5871911
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein
Publication date: 25 January 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Algorithms in computer science (68Wxx)
Related Items (29)
The Minimum Moving Spanning Tree Problem ⋮ Unnamed Item ⋮ Some results on connected vertex separators ⋮ Novel model and solution method for flexible job shop scheduling problem with batch processing machines ⋮ Combined invariant subspace \& frequency-domain subspace method for identification of discrete-time MIMO linear systems ⋮ Sequence to graph alignment using gap-sensitive co-linear chaining ⋮ Parity permutation pattern matching ⋮ A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs ⋮ Corrigendum to: ``Complexity and approximability of the happy set problem ⋮ Wireless IoT sensors data collection reward maximization by leveraging multiple energy- and storage-constrained UAVs ⋮ Stable volumes for persistent homology ⋮ Feasibility assessments of a dynamical approach to compartmental modelling on graphs: scaling limits and performance analysis ⋮ Improved Milne-Hamming method for resolving high-order uncertain differential equations ⋮ Discrete bulk reconstruction ⋮ A GPU-parallelized interpolation-based fast multipole method for the relativistic space-charge field calculation ⋮ Minimizing the total weighted duration of courses in a single machine problem with precedence constraints ⋮ Stability, vertex stability, and unfrozenness for special graph classes ⋮ Two-machine job-shop scheduling with one joint job ⋮ Identities and periodic oscillations of divide-and-conquer recurrences splitting at half ⋮ Classification via two-way comparisons (extended abstract) ⋮ A genetic approach for the 2‐edge‐connected minimum branch vertices problem ⋮ Statistical embedding: beyond principal components ⋮ Some models are useful, but how do we know which ones? Towards a unified Bayesian model taxonomy ⋮ Algorithms for two-agent unbounded serial-batch scheduling with makespan and maximum lateness objectives ⋮ Non-returning deterministic and nondeterministic finite automata with translucent letters ⋮ Robust Factorizations and Colorings of Tensor Graphs ⋮ Social disruption games in signed networks ⋮ Unnamed Item ⋮ AC optimal power flow: a conic programming relaxation and an iterative MILP scheme for global optimization
This page was built for publication:
