2796 search results - page 128 / 560 » The coolest path problem |
171
click to vote
WINE
2010
Springer
15 years 2 months ago
2010
Springer
We consider profit-maximization problems for combinatorial auctions with non-single minded valuation functions and limited supply. We obtain fairly general results that relate the ...
146
click to vote
MP
2007
15 years 4 months ago
2007
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
201
click to vote
APPROX
2000
Springer
15 years 9 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
143
click to vote
STOC
2001
ACM
16 years 5 months ago
2001
ACM
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
179
Voted
SAC
2003
ACM
15 years 10 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...