On minimizing the maximum congestion for weighted hypergraph embedding in a cycle (Q1014437): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Provably good moat routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for embedding hyperedges in a cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for routing around a rectangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for optimal routing around a rectangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4511239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized metarounding (extended abstract) / rank
 
Normal rank

Latest revision as of 12:59, 1 July 2024

scientific article
Language Label Description Also known as
English
On minimizing the maximum congestion for weighted hypergraph embedding in a cycle
scientific article

    Statements

    On minimizing the maximum congestion for weighted hypergraph embedding in a cycle (English)
    0 references
    0 references
    0 references
    28 April 2009
    0 references
    algorithmical approximation
    0 references
    algorithms
    0 references
    hypergraph
    0 references
    LP-relaxation
    0 references
    NP-complete
    0 references

    Identifiers