On the public citation graph
Min-Cost Multicast of Selfish Information Flows
0 signed · 55 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jcss.2001.1754openalex-snapshot
Sharing the Cost of Multicast Transmissions
inferredcites →https://doi.org/10.1016/0166-218x(94)90171-6openalex-snapshot
Network flows: Theory, algorithms and applications
inferredcites →https://doi.org/10.1016/0167-6377(96)00019-3openalex-snapshot
Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
inferredcites →https://doi.org/10.1016/j.peva.2005.07.005openalex-snapshot
On the interaction of multiple overlay routing
inferredcites →https://doi.org/10.1017/cbo9780511528446.003openalex-snapshot
A value for n -person games
inferredcites →https://doi.org/10.1109/focs.2004.26openalex-snapshot
Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users
inferredcites →https://doi.org/10.1109/focs.2004.68openalex-snapshot
The Price of Stability for Network Design with Fair Cost Allocation
inferredcites →https://doi.org/10.1109/focs.2004.69openalex-snapshot
Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games
inferredcites →https://doi.org/10.1109/infcom.2005.1498443openalex-snapshot
Achieving minimum-cost multicast: a decentralized approach based on network coding
inferredcites →https://doi.org/10.1109/infcom.2005.1498444openalex-snapshot
Efficient and distributed computation of maximum multicast rates
inferredcites →https://doi.org/10.1109/infcom.2005.1498493openalex-snapshot
On achieving optimal throughput with network coding
inferredcites →https://doi.org/10.1109/jsac.2004.837362openalex-snapshot
Network planning in wireless ad hoc networks: a cross-Layer approach
inferredcites →https://doi.org/10.1109/jsac.2006.881617openalex-snapshot
A Cross-Layer Optimization Framework for Multihop Multicast in Wireless Mesh Networks
inferredcites →https://doi.org/10.1109/tit.2005.847712openalex-snapshot
Polynomial Time Algorithms for Multicast Network Code Construction
inferredcites →https://doi.org/10.1109/tit.2006.874515openalex-snapshot
On achieving maximum multicast throughput in undirected networks
inferredcites →https://doi.org/10.1109/tit.2006.883636openalex-snapshot
Min-Cost Selfish Multicast With Network Coding
inferredcites →https://doi.org/10.1109/tnet.2003.818197openalex-snapshot
An algebraic approach to network coding
inferredcites →https://doi.org/10.1145/1023720.1023745openalex-snapshot
Truthful multicast routing in selfish wireless networks
inferredcites →https://doi.org/10.1145/1134707.1134716openalex-snapshot
Non-cooperative multicast and facility location games
inferredcites →https://doi.org/10.1145/380752.380883openalex-snapshot
Algorithms, games, and the internet
inferredcites →https://doi.org/10.1145/777412.777464openalex-snapshot
Polynomial time algorithms for network information flow
inferredcites →https://doi.org/10.2307/2583863openalex-snapshot
Network Flows: Theory, Algorithms, and Applications.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-0-387-09441-0_12openalex-snapshot
Designing incentive packet relaying strategies for wireless ad hoc networks with game theory
inferred← citeshttps://doi.org/10.1007/978-981-10-3969-0_29openalex-snapshot
Area Constrained Space Information Flow
inferred← citeshttps://doi.org/10.1109/bdcloud.2018.00024openalex-snapshot
A False-Name-Proof Protocol for Multicast Routing Auctions
inferred← citeshttps://doi.org/10.1109/csa.2015.11openalex-snapshot
A Heuristic Algorithm on Space Information Flow
inferred← citeshttps://doi.org/10.1109/glocom.2014.7037014openalex-snapshot
A recursive partitioning algorithm for space information flow
inferred← citeshttps://doi.org/10.1109/glocomw.2016.7848807openalex-snapshot
A Delaunay Triangulation Approach to Space Information Flow
inferred← citeshttps://doi.org/10.1109/icdcs.2009.29openalex-snapshot
Stochastic Multicast with Network Coding
inferred← citeshttps://doi.org/10.1109/infcom.2009.5062266openalex-snapshot
Shadow Prices vs. Vickrey Prices in Multipath Routing
inferred← citeshttps://doi.org/10.1109/infcom.2009.5062277openalex-snapshot
Selfish Distributed Compression over Networks
inferred← citeshttps://doi.org/10.1109/infcomw.2014.6849294openalex-snapshot
Congestion-aware internet pricing for media streaming
inferred← citeshttps://doi.org/10.1109/mascot.2008.4770563openalex-snapshot
Optimal Layered Multicast with Network Coding: Mathematical Model and Empirical Studies
inferred← citeshttps://doi.org/10.1109/netcod.2013.6570816openalex-snapshot
On Space Information Flow: Single multicast
inferred← citeshttps://doi.org/10.1109/tcomm.2013.021413.110555openalex-snapshot
Inter-Session Network Coding with Strategic Users: A Game-Theoretic Analysis of the Butterfly Network
inferred← citeshttps://doi.org/10.1109/tcomm.2014.2318701openalex-snapshot
Decoding Delay Minimization in Inter-Session Network Coding
inferred← citeshttps://doi.org/10.1109/tit.2011.2173720openalex-snapshot
Bounding the Coding Advantage of Combination Network Coding in Undirected Networks
inferred← citeshttps://doi.org/10.1109/tit.2012.2184660openalex-snapshot
Selfish Distributed Compression Over Networks: Correlation Induces Anarchy
inferred← citeshttps://doi.org/10.1109/tpds.2011.197openalex-snapshot
On Achieving Group-Strategyproof Multicast
inferred← citeshttps://doi.org/10.1109/wicom.2007.629openalex-snapshot
Lifetime Maximization in Wireless Sensor Networks with Network Coding
inferred← citeshttps://doi.org/10.1145/2379790.2379798openalex-snapshot
Algorithms for stochastic optimization of multicast content delivery with network coding
inferred← citeshttps://doi.org/10.1371/journal.pone.0193350openalex-snapshot
Exact and heuristic algorithms for Space Information Flow
inferred← citeshttps://doi.org/10.1504/ijcnds.2009.026618openalex-snapshot
Game theoretic packet relaying model for wireless ad hoc networks
inferred← citeshttps://doi.org/10.3390/s17040902openalex-snapshot
Connectivity Restoration in Wireless Sensor Networks via Space Network Coding
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.