752 search results - page 41 / 151 » Faster approximation algorithms for the minimum latency prob... |
154
click to vote
SODA
2012
ACM
13 years 3 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,...
105
click to vote
SODA
2008
ACM
15 years 2 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
100
click to vote
SWAT
2004
Springer
15 years 6 months ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
111
click to vote
CIAC
2006
Springer
15 years 5 months ago
2006
Springer
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
121
click to vote
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
This paper addresses the state estimation problem of nonlinear systems. We formulate the problem using a minimum energy estimator (MEE) approach and propose an entropy penalized sc...