412 search results - page 8 / 83 » Single-Sink Network Design with Vertex Connectivity Requirem... |
STOC
2003
ACM
15 years 10 months ago
2003
ACM
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requ...
STOC
1993
ACM
15 years 1 months ago
1993
ACM
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
127
click to vote
SIROCCO
1997
14 years 11 months ago
1997
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...
ESA
2007
Springer
15 years 3 months ago
2007
Springer
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...
168
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Network data models are frequently used as a mechanism to describe the connectivity between spatial features in many emerging GIS applications (location-based services, transporta...