scientific article

Ronald L. Rivest, Thomas H. Cormen, Charles E. Leiserson, Clifford Stein

Publication date: 14 October 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

linear programming probabilistic analysis randomized algorithms

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Searching and sorting (68P10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Nonnumerical algorithms (68W05) Linear programming (90C05) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Randomized algorithms (68W20) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01)

Related Items (only showing first 100 items - show all)

Fast learning of restricted regular expressions and dtds ⋮ Efficient algorithms for the round-trip 1-center and 1-median problems ⋮ Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees ⋮ Minimum cost input/output design for large-scale linear structural systems ⋮ Continuous amortization and extensions: with applications to bisection-based root isolation ⋮ Complexity aspects of the triangle path convexity ⋮ Dimensionality reduction of collective motion by principal manifolds ⋮ The minimal \(k\)-core problem for modeling \(k\)-assemblies ⋮ Exact algorithms for size constrained 2-clustering in the plane ⋮ Reducing multivalued discrete variables in solving separable task assignment problems ⋮ Ranking chain sum orders ⋮ Multi-agent planning under local LTL specifications and event-based synchronization ⋮ Pricing Asian option by the FFT with higher-order error convergence rate under Lévy processes ⋮ A linear time algorithm for inverse obnoxious center location problems on networks ⋮ Gallai-Edmonds decomposition as a pruning technique ⋮ Algebraic dynamic programming for multiple context-free grammars ⋮ Characterizing local optima for maximum parsimony ⋮ Analysis of complex network performance and heuristic node removal strategies ⋮ A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs ⋮ The weighted uncapacitated planned maintenance problem: complexity and polyhedral properties ⋮ A note on algebraic expressions of rhomboidal labeled graphs ⋮ A minimized-rule based approach for improving data currency ⋮ Tri-connectivity augmentation in trees ⋮ Wirelength of enhanced hypercubes into \(r\)-rooted complete binary trees ⋮ Approximability of the minimum-weight \(k\)-size cycle cover problem ⋮ Fast pattern-based algorithms for cutting stock ⋮ A scheduling problem with three competing agents ⋮ A theoretical development for the total tardiness problem and its application in branch and bound algorithms ⋮ \((r|p)\)-centroid problems on networks with vertex and edge demand ⋮ The multimode covering location problem ⋮ Algorithmic aspects of open neighborhood location-domination in graphs ⋮ Do branch lengths help to locate a tree in a phylogenetic network? ⋮ A three-dimensional parametric mesher with surface boundary-layer capability ⋮ Mining non-redundant diverse patterns: an information theoretic perspective ⋮ Gaussian quantum computation with oracle-decision problems ⋮ Proof systems and transformation games ⋮ Embeddings of circulant networks ⋮ Embedding of biological regulatory networks and property preservation ⋮ Invariants for homology classes with application to optimal search and planning problem in robotics ⋮ Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem ⋮ A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks ⋮ Probing the space of toric quiver theories ⋮ Generalizations of Wiener polarity index and terminal Wiener index ⋮ Fastest-path planning for direction-dependent speed functions ⋮ Exploiting symmetries for scaling loopy belief propagation and relational training ⋮ Nonrigid 3D medical image registration and fusion based on deformable models ⋮ A hybrid model predictive control scheme for containment and distributed sensing in multi-agent systems ⋮ Motion planning with pulley, rope, and baskets ⋮ Fast recognition of doubled graphs ⋮ Optimal working time distribution and routing for autonomous tractors based on heuristic algorithms ⋮ Solving the quadratic minimum spanning tree problem ⋮ On optimal cryptographic key derivation ⋮ One-dimensional approximate point set pattern matching with \(L_p\)-norm ⋮ Efficient string-matching allowing for non-overlapping inversions ⋮ A new dichotomic algorithm for the uniform random generation of words in regular languages ⋮ Parameterized complexity of max-lifetime target coverage in wireless sensor networks ⋮ Solving min ones 2-SAT as fast as vertex cover ⋮ Efficient algorithm for the vertex connectivity of trapezoid graphs ⋮ Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs ⋮ On the Kirchhoff and the Wiener indices of graphs and block decomposition ⋮ An improved algorithm for the red-blue hitting set problem with the consecutive ones property ⋮ Variants of constrained longest common subsequence ⋮ Physical portrayal of computational complexity ⋮ Face recognition from caption-based supervision ⋮ Computing convex quadrangulations ⋮ Running time analysis of ant colony optimization for shortest path problems ⋮ Crossover can provably be useful in evolutionary computation ⋮ Analysis of an iterated local search algorithm for vertex cover in sparse random graphs ⋮ Some results on approximate 1-median selection in metric spaces ⋮ A local level-set method using a hash table data structure ⋮ Covering moving points with anchored disks ⋮ A fast object-oriented MATLAB implementation of the reproducing kernel particle method ⋮ Scaling the kernel function based on the separating boundary in input space: a data-dependent way for improving the performance of kernel methods ⋮ Aerospace design optimization using a steady state real-coded genetic algorithm ⋮ Can quantum entanglement detection schemes improve search? ⋮ Toward a model for backtracking and dynamic programming ⋮ Computing optimal islands ⋮ Optimizing performance and reliability on heterogeneous parallel systems: approximation algorithms and heuristics ⋮ On efficient calculations for Bayesian variable selection ⋮ Fault tolerance analysis of mesh networks with uniform versus nonuniform node failure probability ⋮ An SCP-based heuristic approach for scheduling distributed data-intensive applications on global grids ⋮ Spherical coverage verification ⋮ A semi-dynamical approach for solving qualitative spatial constraint satisfaction problems ⋮ Polynomial time approximation schemes for the constrained minimum spanning tree problem ⋮ Designing and proving correct a convex hull algorithm with hypermaps in Coq ⋮ Committee selection under weight constraints ⋮ Full-rank representations of outer inverses based on the QR decomposition ⋮ Dictionary-symbolwise flexible parsing ⋮ A new distributed topology control algorithm based on optimization of delay and energy in wireless networks ⋮ An accurate performance model for network-on-chip and multicomputer interconnection networks ⋮ Topological ordering algorithm for LDAG ⋮ Selecting and estimating regular vine copulae and application to financial returns ⋮ A fast algorithm for computing distance correlation ⋮ Half-trek criterion for generic identifiability of linear structural equation models ⋮ Discovery of optimal factors in binary data via a novel method of matrix decomposition ⋮ Dimension-reduced nonparametric maximum likelihood computation for interval-censored data ⋮ The orienteering problem with time windows applied to robotic melon harvesting ⋮ Scalable genomics with \texttt{R} and bioconductor ⋮ 3SUM, 3XOR, triangles ⋮ An algorithm for computing cutpoints in finite metric spaces

This page was built for publication: