4110 search results - page 55 / 822 » Efficient algorithms for the 2-gathering problem |
125
click to vote
CIAC
2010
Springer
15 years 7 months ago
2010
Springer
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
106
click to vote
ENTCS
2008
15 years 3 months ago
2008
Efficient handling of quantifiers is crucial for solving software verification problems. E-matching algorithms are used in satisfiability modulo theories solvers that handle quant...
114
click to vote
JOC
2000
15 years 3 months ago
2000
We present efficient algorithms for computing discrete logarithms in the classgroupofaquadraticorderandforprincipalitytestinginarealquadraticorder,based on the work of D
119
click to vote
ACL
2006
15 years 5 months ago
2006
We present an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR) of a scope ambiguity, compute an USR with fewer mut...
138
click to vote
EOR
2010
15 years 3 months ago
2010
In this work we study the Capacitated p-Center Problem (CpCP) and we propose an exact algorithm to solve it. We study two auxiliary problems and their relation to CpCP, and we pro...