9532 search results - page 440 / 1907 » Logic, Graphs, and Algorithms |
155
click to vote
SWAT
2004
Springer
16 years 6 days ago
2004
Springer
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introdu...
173
Voted
ESA
2008
Springer
15 years 8 months ago
2008
Springer
Given an n-node graph and a subset of k terminal nodes, the NP-hard Steiner tree problem is to compute a minimum-size tree which spans the terminals. All the known algorithms for t...
154
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of...
184
click to vote
SCAM
2006
IEEE
16 years 26 days ago
2006
IEEE
Call graphs are widely used to represent calling relationships among methods. However, there is not much interest in calling relationships among library methods in many software e...
166
click to vote
SIGECOM
2005
ACM
16 years 13 days ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...