1101 search results - page 137 / 221 » An Algorithm for the Graph Crossing Number Problem |
111
Voted
FOCS
1996
IEEE
15 years 6 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
122
Voted
PODC
2005
ACM
15 years 8 months ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
137
Voted
IPPS
1999
IEEE
15 years 7 months ago
1999
IEEE
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
135
Voted
ISPD
2010
ACM
15 years 9 months ago
2010
ACM
Double Patterning Lithography (DPL) is one of the few hopeful candidate solutions for the lithography for CMOS process beyond 45nm. DPL assigns the patterns less than a certain di...
106
Voted
IPPS
2003
IEEE
15 years 8 months ago
2003
IEEE
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are different. We assum...