4930 search results - page 42 / 986 » Learning minimal abstractions |
COCOON
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We show that minimal k-vertex connected spanning subgraphs of a given graph can be generated in incremental polynomial time for any fixed k.
ALGORITHMICA
2010
15 years 18 days ago
2010
Abstract Given an n-point metric (P,d) and an integer k > 0, we consider the problem of covering P by k balls so as to minimize the sum of the radii of the balls. We present a r...
104
click to vote
JGO
2008
15 years 13 days ago
2008
Abstract In this paper a basic structural problem in Generalized Semi-Infinite Programming is solved. In fact, under natural and generic assumptions we show that at any (local) min...
70
Voted
EOR
2002
15 years 8 days ago
2002
Abstract. We present fully polynomial approximation schemes for the problem of minimizing completion time variance of a set of n jobs on a single machine. The fastest of these sche...
112
Voted
SIAMJO
2000
15 years 7 days ago
2000
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...