Incremental flow
From MaRDI portal
Publication:3593373
DOI10.1002/NET.20168zbMATH Open1119.90007OpenAlexW4242737545MaRDI QIDQ3593373FDOQ3593373
Authors: Jeff Hartline, Alexa Sharp
Publication date: 20 July 2007
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20168
Recommendations
Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10)
Cites Work
Cited In (6)
- Incremental network optimization: theory and algorithms
- General bounds for incremental maximization
- Incremental network design with shortest paths
- Clairvoyant mechanisms for online auctions
- Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows
- Fractionally subadditive maximization under an incremental knapsack constraint
This page was built for publication: Incremental flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3593373)