An introduction to parallelism in combinatorial optimization (Q1076605): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3241581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel algorithm for constructing minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The general problem solving algorithm and its implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming and parallel computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An observation on time-storage trade off / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a complexity theory of synchronous parallel computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Matrix and Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary Trees and Parallel Scheduling Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Scheduling Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming is log-space hard for P / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4128417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal interconnection pattern for parallel computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum flow problem is log space complete for P / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Solution for the Channel-Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing a perfect matching is in random NC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4197641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anomalies in parallel branch-and-bound algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Deadlines and Loss Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds to Complexities of Networks for Sorting and for Switching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-bound and parallel computation: A historical note / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ultracomputers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis Techniques for SIMD Machine Interconnection Networks and the Effects of Processor Address Masks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Processing with the Perfect Shuffle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility by algebraic projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3700795 / rank
 
Normal rank

Latest revision as of 13:32, 17 June 2024

scientific article
Language Label Description Also known as
English
An introduction to parallelism in combinatorial optimization
scientific article

    Statements

    An introduction to parallelism in combinatorial optimization (English)
    0 references
    0 references
    0 references
    1986
    0 references
    sorting
    0 references
    shortest paths
    0 references
    scheduling
    0 references
    knapsack
    0 references
    branch and bound
    0 references
    traveling salesman
    0 references
    parallel computers
    0 references
    combinatorial optimization
    0 references
    complexity theory for parallel computations
    0 references
    polylog parallel algorithms
    0 references
    log space completeness
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references