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
On the hardness of approximating minimum vertex cover
Irit Dinur,Samuel Safra +1 more
TL;DR: The Minimum Vertex Cover problem is proved to be NP-hard to approximate to within a factor of 1.3606, extending on previous PCP and hardness of approximation technique.
Truth revelation in approximately efficient combinatorial auctions
TL;DR: It is shown that the GVA payment scheme does not provide for a truth revealing mechanism, and another scheme is introduced that does guarantee truthfulness for a restricted class of players.
699
•Posted Content
Truth Revelation in Approximately Efficient Combinatorial Auctions
TL;DR: It is shown that the GVA payment scheme does not provide for a truth revealing mechanism, and another scheme is introduced that does guarantee truthfulness for a restricted class of players.
On Moore graphs with diameters 2 and 3
Alan J. Hoffman,R. R. Singleton +1 more
TL;DR: The proof exploits the characteristic roots and vectors of the adjacency matrix (and its principal submatrices) of the graph to prove the existence of connected, undirected graphs homogeneous of degree d and of diameter k.
593
An Analysis for Unreplicated Fractional Factorials
George E. P. Box,R. Daniel Meyer +1 more
TL;DR: A more formal analysis is presented here, which may be used to supplement such plots and hence to facilitate the use of these unreplicated experimental arrangements.
590