Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Approximate pricing in networks: How to boost the betweenness and revenue of a node

Autor: Brokkelkamp, Ruben, Polak, Sven, Schäfer, Guido, Velaj, Yllka, Lu, Pinyan, Zhang, Guochuan

Publikováno v: Brokkelkamp, R, Polak, S, Schäfer, G & Velaj, Y 2019, Approximate pricing in networks : How to boost the betweenness and revenue of a node . in P Lu & G Zhang (eds), 30th International Symposium on Algorithms and Computation (ISAAC 2019) ., 13, Leibniz International Proceedings in Informatics, LIPIcs, vol. 149, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, pp. 1-15, 30th International Symposium on Algorithms and Computation, ISAAC 2019, Shanghai, China, 8/12/19 . https://doi.org/10.4230/LIPIcs.ISAAC.2019.13
30th International Symposium on Algorithms and Computation (ISAAC 2019), 1-15
STARTPAGE=1;ENDPAGE=15;TITLE=30th International Symposium on Algorithms and Computation (ISAAC 2019)

We introduce and study two new pricing problems in networks: Suppose we are given a directed graph G = (V, E) with non-negative edge costs (c_e)_{e in E}, k commodities (s_i, t_i, w_i)_{i in [k]} and a designated node u in V. Each commodity i in [k]

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::948031f8b963c9103ebfd4c7880edf3f
https://ir.cwi.nl/pub/29187