A fast algorithm for a class of bottleneck problems (Q1916054): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving linear bottleneck assignment problems via strong spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Min-Max Spanning Tree Problem and some extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An augmenting path method for solving linear bottleneck assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck extrema / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for two bottleneck optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bottleneck Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem / rank
 
Normal rank

Latest revision as of 12:59, 24 May 2024

scientific article
Language Label Description Also known as
English
A fast algorithm for a class of bottleneck problems
scientific article

    Statements

    A fast algorithm for a class of bottleneck problems (English)
    0 references
    0 references
    0 references
    0 references
    2 July 1996
    0 references
    0 references
    0 references
    0 references
    0 references
    polynomial algorithms
    0 references
    bottleneck problem
    0 references
    ordered list of element costs
    0 references