Sciweavers

2738 search results - page 7 / 548
» The Frobenius Problem and Its Generalizations
Sort
View
TCS
2011
14 years 4 months ago
Dynamic normal forms and dynamic characteristic polynomial
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
Gudmund Skovbjerg Frandsen, Piotr Sankowski
JACM
2006
92views more  JACM 2006»
14 years 9 months ago
The generalized two-server problem
We consider the generalized on-line two-server problem in which at each step each server receives a request, which is a point in a metric space. One of the servers has to be moved ...
René A. Sitters, Leen Stougie
ESA
2003
Springer
124views Algorithms» more  ESA 2003»
15 years 2 months ago
The Minimum Generalized Vertex Cover Problem
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
Refael Hassin, Asaf Levin
ICALP
2003
Springer
15 years 2 months ago
A Competitive Algorithm for the General 2-Server Problem
We consider the general on-line two server problem in which at each step both servers receive a request, which is a point in a metric space. One of the servers has to be moved to i...
René Sitters, Leen Stougie, Willem de Paepe
76
Voted
EMMCVPR
2009
Springer
15 years 4 months ago
General Search Algorithms for Energy Minimization Problems
We describe a scheme for solving Energy Minimization problems, which is based on the A∗ algorithm accomplished with appropriately chosen LP-relaxations as heuristic functions. Th...
Dmitrij Schlesinger