Journal Issue10.1002/NET.V53:1
Optimal pricing of capacitated networks
154
TL;DR: Several results are derived on the algorithmic complexity of a profit maximization problem in capacitated, undirected networks, given that the network is either a path, a cycle, a tree, or a grid.
read more
Abstract: We address the algorithmic complexity of a profit maximization problem in capacitated, undirected networks. We are asked to price a set of m capacitated network links to serve a set of n potential customers. Each customer is interested in purchasing a network connection that is specified by a simple path in the network and has a maximum budget that we assume to be known to the seller. The goal is to decide which customers to serve, and to determine prices for all network links in order to maximize the total profit. We address this pricing problem in different network topologies. More specifically, we derive several results on the algorithmic complexity of this profit maximization problem, given that the network is either a path, a cycle, a tree, or a grid. Our results include approximation algorithms as well as inapproximability results. © 2008 Wiley Periodicals, Inc. NETWORKS, 2009
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
An intelligent fault detection approach based on reinforcement learning system in wireless sensor network
Tariq Mahmood,Tariq Mahmood,Jianqiang Li,Yan Pei,Faheem Akhtar,Suhail Ashfaq Butt,Allah Ditta,Sirajuddin Qureshi +7 more
TL;DR: This research presents an intelligent fault detection, energy-efficient, quality-of-service routing technique based on reinforcement learning to find the optimum route with the least amount of end-to-end latency.
58
k-Connectivity in Random Key Graphs with Unreliable Links.
TL;DR: In this article, the authors studied the connectivity properties of random key graphs in the presence of unreliable links, where link unreliability is captured by independent Bernoulli random variables, rendering edges of the graph to be on or off independently from each other.
56
Phase transitions for detecting latent geometry in random graphs
TL;DR: It is proved that the random intersection graph converges in total variation to G(n, p) when d = \tilde{\omega}(n^3) and does not if $d = o(n*3)$, resolving an open problem in Fill et al. (2018).
48
On Connectivity and Robustness in Random Intersection Graphs
TL;DR: This paper establishes sharp asymptotic zero-one laws for connectivity and robustness in a general random intersection graph model and considers two special cases of the general model, abinomialrandom intersection graph and a uniform random intersection graphs, which both have numerous applications as well.
43
Topological Properties of Secure Wireless Sensor Networks Under the $q$ -Composite Key Predistribution Scheme With Unreliable Links
TL;DR: In this article, the authors investigated the topological properties related to node degree in WSNs operating under the $q$ -composite scheme with unreliable communication links modeled as independent ON/OFF channels, and showed that the number of nodes with a fixed degree is in distribution asymptotically equivalent to a Poisson random variable.
42
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Collective dynamics of small-world networks
TL;DR: Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Emergence of Scaling in Random Networks
TL;DR: A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
39.1K
Statistical mechanics of complex networks
TL;DR: In this paper, a simple model based on the power-law degree distribution of real networks was proposed, which was able to reproduce the power law degree distribution in real networks and to capture the evolution of networks, not just their static topology.
The Structure and Function of Complex Networks
TL;DR: Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.