522 search results - page 24 / 105 » The 3-Steiner Root Problem |
COCOA
2008
Springer
13 years 10 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems, where facilities not only need to be opened ...
COCOON
2008
Springer
13 years 10 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
ICCAD
1997
IEEE
14 years 26 days ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
AMAI
2000
Springer
13 years 8 months ago
2000
Springer
This is a prospective on the research in the intersection of mathematics and artificial intelligence that I see as having been the most important over the past 10 years and that I...