Costly circuits, submodular schedules and approximate Carathéodory theorems (Q1649974): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1512.01271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2913806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Submodular Function Maximization under Linear Packing Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Nash Equilibria and Dense Bipartite Subgraphs via an Approximate Version of Caratheodory's Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Network-Based Primal-Dual Heuristic for the Solution of Multicommodity Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost capacity installation for multicommodity network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Birkhoff-von Neumann input-buffered crossbar switches for guaranteed-rate services / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Approximation for Maximum Weight Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient dispersal of information for security, load balancing, and fault tolerance / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the speedup required for combined input- and output-queued switching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Fractional Multicommodity Flow Independent of the Number of Commodities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander graphs and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation algorithms for multicommodity flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacity and flow assignment of data networks by generalized Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5495117 / rank
 
Normal rank

Latest revision as of 01:15, 16 July 2024

scientific article
Language Label Description Also known as
English
Costly circuits, submodular schedules and approximate Carathéodory theorems
scientific article

    Statements

    Costly circuits, submodular schedules and approximate Carathéodory theorems (English)
    0 references
    29 June 2018
    0 references
    data center networks
    0 references
    bridges and switches
    0 references
    circuit networks
    0 references
    network flows
    0 references
    submodular optimization
    0 references
    approximation algorithms
    0 references
    0 references
    0 references
    0 references

    Identifiers

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