Sciweavers

439 search results - page 26 / 88
» A Branch-and-Price Algorithm for the Multilevel Generalized ...
Sort
View
EJC
2007
13 years 7 months ago
Quickly deciding minor-closed parameters in general graphs
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
SETN
2004
Springer
14 years 1 months ago
Construction and Repair: A Hybrid Approach to Search in CSPs
Abstract. In order to obtain a solution to a constraint satisfaction problem, constructive methods iteratively extend a consistent partial assignment until all problem variables ar...
Konstantinos Chatzikokolakis, George Boukeas, Pana...
FSTTCS
2009
Springer
14 years 2 months ago
Donation Center Location Problem
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
Chien-Chung Huang, Zoya Svitkina
WWW
2008
ACM
14 years 8 months ago
Composite process oriented service discovery in preserving business and timed relation
This paper proposes an approach for solving the problem of composite process oriented service discovery with preserving business and timed relation. Key to our approach is the def...
Yu Dai, Lei Yang, Bin Zhang, Kening Gao
GBRPR
2005
Springer
14 years 1 months ago
Approximating the Problem, not the Solution: An Alternative View of Point Set Matching
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
Tibério S. Caetano, Terry Caelli