Selfish splittable flows and NP-completeness (Q465681): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Q239694 / rank
Normal rank
 
Property / author
 
Property / author: Paul G. Spirakis / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68M20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68M10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68-02 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6361000 / rank
 
Normal rank
Property / zbMATH Keywords
 
network performance
Property / zbMATH Keywords: network performance / rank
 
Normal rank
Property / zbMATH Keywords
 
selfish routing
Property / zbMATH Keywords: selfish routing / rank
 
Normal rank
Property / zbMATH Keywords
 
Braess's paradox
Property / zbMATH Keywords: Braess's paradox / rank
 
Normal rank
Property / zbMATH Keywords
 
Althoefer's sparsification lemma
Property / zbMATH Keywords: Althoefer's sparsification lemma / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cosrev.2011.04.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973957391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3533739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4885257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms, games, and the internet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über ein Paradoxon aus der Verkehrsplanung / rank
 
Normal rank
Property / cites work
 
Property / cites work: Braess's Paradox in large random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Methods for Selfish Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traffic assignment problem for a general network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Prevalence of Paradoxes in Transportation Equilibrium Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of pure Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear networks. IIa / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network topology and the efficiency of equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4197641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3873927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for minimum quadratic cost flow problems / 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: Complexity and algorithms for nonlinear optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex separable optimization is not much harder than linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the severity of Braess's paradox: designing networks for selfish users is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness of solution in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparse approximations to randomized strategies and convex combinations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:39, 9 July 2024

scientific article
Language Label Description Also known as
English
Selfish splittable flows and NP-completeness
scientific article

    Statements

    Selfish splittable flows and NP-completeness (English)
    0 references
    0 references
    0 references
    24 October 2014
    0 references
    network performance
    0 references
    selfish routing
    0 references
    Braess's paradox
    0 references
    Althoefer's sparsification lemma
    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
    0 references