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
Introduction to random graphs
Alan Frieze,Michał Karoński +1 more
- 01 Jan 2016
TL;DR: All those interested in discrete mathematics, computer science or applied probability and their applications will find this an ideal introduction to the subject.
•Posted Content
Connectivity of the Uniform Random Intersection Graph
TL;DR: The paper determines the threshold for connectivity of the graph G(n,m,k) when n->~ in many situations, in particular when modelling the network graph of the well-known key predistribution technique due to Eschenauer and Gligor.
91
Performance of the Eschenauer-Gligor key distribution scheme under an ON/OFF channel
TL;DR: In this paper, the secure connectivity of wireless sensor networks under the random key distribution scheme of Eschenauer and Gligor was investigated, and conditions on how to scale the model parameters so that the network has no secure node which is isolated and is securely connected with high probability when the number of sensor nodes becomes large.
On resilience and connectivity of secure wireless sensor networks under node capture attacks
TL;DR: This paper analyzes the resilience of the composite key predistribution scheme, which mitigates the node capture vulnerability of the Eschenauer-Gligor scheme in the neighbor discovery phase and derives the critical network parameters to ensure connectivity in both the absence and presence of node-capture attacks.
62
On the strengths of connectivity and robustness in general random intersection graphs
Jun Zhao,Osman Yagan,Virgil D. Gligor +2 more
- 01 Dec 2014
TL;DR: The strengths of connectivity and robustness in a general random intersection graph model are investigated, and sharp asymptotic zero-one laws for k-connectivity and k-robustness are established.
References
An Algorithmic Approach to Network Location Problems. II: The p-Medians
O. Kariv,S. L. Hakimi +1 more
TL;DR: An algorithm is presented which finds a p-median of a tree (for $p > 1$) in time $O(n^2 \cdot p^2 )$.
1.4K
Network Design and Transportation Planning: Models and Algorithms
TL;DR: It is shown that many of the most celebrated combinatorial problems that arise in transportation planning are specializations and variations of a generic design model, Consequently, the network design concepts described in this paper have great potential application in a wide range of problem settings.
1.3K
A survey of gossiping and broadcasting in communication networks
TL;DR: Gossiping and broadcasting are two problems of information dissemination described for a group of individuals connected by a communication network as discussed by the authors, and the results that have been obtained on these and related problems.
1.2K
Access and Alignment of Data in an Array Processor
TL;DR: This paper discusses the design of a primary memory system for an array processor which allows parallel, conflict-free access to various slices of data, and subsequent alignment of these data for processing, and a network based on Stone's shuffle-exchange operation is presented.
1.2K
Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs
TL;DR: An article of golfing equipment has a golf tee attached to a spring-biassed reel by a length of string which can be aligned with the green or hole and used as an aid in swinging the club face in the correct direction.
1.2K