1405 search results - page 233 / 281 » Popularity at Minimum Cost |
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
73
Voted
ACMICEC
2004
ACM
15 years 3 months ago
2004
ACM
In this paper, we describe the operation of barter trade exchanges by identifying key techniques used by trade brokers to stimulate trade and satisfy member needs, and present alg...
79
Voted
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
102
click to vote
STOC
2010
ACM
15 years 2 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
107
click to vote
ERCIMDL
2001
Springer
15 years 2 months ago
2001
Springer
This paper proposes an approach to the problem of generating metadata for composite mixed-media digital objects by appropriately combining and exploiting existing knowledge or met...