Sciweavers

626 search results - page 49 / 126
» On Approximability of Minimum Bisection Problem
Sort
View
INFORMS
2008
241views more  INFORMS 2008»
13 years 8 months ago
Solving the Capacitated Local Access Network Design Problem
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
F. Sibel Salman, R. Ravi, John N. Hooker
ALGORITHMICA
2010
141views more  ALGORITHMICA 2010»
13 years 8 months ago
Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
Dániel Marx, Ildikó Schlotter
COMPGEOM
2004
ACM
14 years 1 months ago
On the least median square problem
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...
Jeff Erickson, Sariel Har-Peled, David M. Mount
ESA
1998
Springer
145views Algorithms» more  ESA 1998»
14 years 22 days ago
Moving-Target TSP and Related Problems
Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent ...
Christopher S. Helvig, Gabriel Robins, Alexander Z...
ISAAC
2009
Springer
168views Algorithms» more  ISAAC 2009»
14 years 3 months ago
On the Camera Placement Problem
We introduce a new probing problem: what is the minimum number of cameras at fixed positions necessary and sufficient to reconstruct any strictly convex polygon contained in a dis...
Rudolf Fleischer, Yihui Wang