Cost Sharing in Networks
| Autor: | Anja Schedel |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Property (philosophy)
Computer science Generalization Context (language use) Combinatorics Set (abstract data type) TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY Path (graph theory) Hardware_INTEGRATEDCIRCUITS Cost sharing Enhanced Data Rates for GSM Evolution Computer Science::Data Structures and Algorithms Undirected graph MathematicsofComputing_DISCRETEMATHEMATICS |
| Zdroj: | Cost Sharing, Capacity Investment and Pricing in Networks ISBN: 9783658331696 |
| DOI: | 10.1007/978-3-658-33170-2_3 |
| Popis: | In the following chapter of this thesis, we consider a generalization of the well-known combinatorial Steiner forest problem in a game-theoretic context. In the Steiner forest problem, we are given an undirected graph with nonnegative edge costs, and a set of pairs of vertices called source-sink pairs. The aim is to find a cost-minimal subgraph with the property that there is a path between the source and the sink for each source-sink pair. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|