1951 search results - page 102 / 391 » An algorithm for improving graph partitions |
147
click to vote
APPROX
2006
Springer
15 years 8 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
154
click to vote
ICALP
2011
Springer
14 years 8 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
121
click to vote
COMPGEOM
1995
ACM
15 years 8 months ago
1995
ACM
We outline an algorithm and implementation of a system that computes Boolean combinations of sculptured solids. We represent the surface of the solids in terms of trimmed and untr...
128
click to vote
WEA
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
124
click to vote
ITC
1997
IEEE
15 years 8 months ago
1997
IEEE
A deterministic-partitioning technique and an improved analysis scheme for fault diagnosis in Scan-Based BIST is proposed. The incorporation of the superposition principle to the ...