7129 search results - page 188 / 1426 » Approximation Algorithms for Treewidth |
170
click to vote
ECRTS
2004
IEEE
15 years 10 months ago
2004
IEEE
This paper presents a new approach to understand the event stream model. Additionally a new approximation algorithm for the feasibility test of the sporadic and the generalized mu...
165
click to vote
CAGD
2005
15 years 6 months ago
2005
In this paper we present an algorithm for parametrizing approximate algebraic surfaces by lines. The algorithm is applicable to -irreducible algebraic surfaces of degree d having ...
166
click to vote
SIAMDM
2000
15 years 6 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
154
click to vote
WADS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We give processor-allocation algorithms for grid architectures, where the objective is to select processors from a set of available processors to minimize the average num...
163
click to vote
SWAT
1994
Springer
15 years 10 months ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...