scientific article; zbMATH DE number 1302200

zbMATH Open0944.90067MaRDI QIDQ4247467

José Rolim, Sanguthevar Rajasekaran

Publication date: 26 September 2000

Title of this publication is not available (Why is that?)

zbMATH Keywords

surveysortingcombinatorial optimizationChernoff boundscomplexity classesnetwork flow problemsdepth first searchmatching problemsminimum cost spanning treesshortest paths problemspacket routingmaximal independent set problemsparallel randomized algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (7)

An introduction to parallelism in combinatorial optimization ⋮ Title not available (Why is that?) ⋮ The Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms ⋮ Parallel Combinatorial Optimization with Decision Diagrams ⋮ An optimal parallel algorithm for generating combinations ⋮ Tight Analysis of Parallel Randomized Greedy MIS ⋮ Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4247467)