ESA
2004
Springer
14 years 5 months ago
2004
Springer
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
ESA
2004
Springer
14 years 5 months ago
2004
Springer
We study polynomials of degree up to 4 over the rationals or a computable real subfield. Our motivation comes from the need to evaluate predicates in nonlinear computational geome...
ESA
2004
Springer
14 years 5 months ago
2004
Springer
The task of balancing dynamically generated work load occurs in a wide range of parallel and distributed applications. Diffusion based schemes, which belong to the class of nearest...
ESA
2004
Springer
14 years 5 months ago
2004
Springer
ESA
2004
Springer
14 years 5 months ago
2004
Springer
Many network applications that need to distribute content and data to a large number of clients use a hybrid scheme in which one (or more) multicast channel is used in parallel to...
ESA
2004
Springer
14 years 5 months ago
2004
Springer
This paper considers the convergence problem in autonomous mobile robot systems. A natural algorithm for the problem requires the robots to move towards their center of gravity. Th...
ESA
2004
Springer
14 years 5 months ago
2004
Springer
ESA
2004
Springer
14 years 5 months ago
2004
Springer
ESA
2004
Springer
14 years 5 months ago
2004
Springer
ESA
2004
Springer
14 years 5 months ago
2004
Springer
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...