The Complexity of Bottleneck Labeled Graph Problems (Q3508579): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Pipage rounding: a new method of constructing algorithms with proven performance guarantee / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the min-max and min-max regret assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Categorized bottleneck-minisum path problems on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with many or few colors in edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4659605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search for the minimum label spanning tree problem with bounded color classes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum labeling spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple criteria optimization: State of the art annotated bibliographic surveys / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms and Hardness Results for Labeled Connectivity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Matching Problems for Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximating the longest path in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching of given weight in complete and complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The labeled perfect matching in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traveling salesman problem under categorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bottleneck assignment problems under categorization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum perfect bipartite matchings and spanning trees under categorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi‐objective combinatorial optimization problems: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bibliography on the Applications of Mathematical Programming Multiple-objective Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in colored bipartite networks / rank
 
Normal rank

Latest revision as of 12:59, 28 June 2024

scientific article
Language Label Description Also known as
English
The Complexity of Bottleneck Labeled Graph Problems
scientific article

    Statements

    The Complexity of Bottleneck Labeled Graph Problems (English)
    0 references
    0 references
    0 references
    0 references
    1 July 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references