1279 search results - page 21 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
134
click to vote
ESA
2006
Springer
15 years 7 months ago
2006
Springer
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
189
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
Given an undirected graph with edge lengths and a subset of nodes (called the terminals), the multiway cut (also called the multi-terminal cut) problem asks for a subset of edges,...
140
click to vote
SIAMCO
2010
14 years 11 months ago
2010
Abstract. We establish results for the problem of tracking a time-dependent manifold arising in realtime optimization by casting this as a parametric generalized equation. We demon...
121
click to vote
STOC
1999
ACM
15 years 8 months ago
1999
ACM
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
150
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper presents an analytical approach to evaluate the expected complexity of a generalized sphere decoding (GSD) algorithm, GSDλ − , for underdetermined integer leastsquare...