1101 search results - page 60 / 221 » An Algorithm for the Graph Crossing Number Problem |
134
click to vote
SIAMJO
2008
15 years 2 months ago
2008
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
212
Voted
ICDE
2008
IEEE
16 years 3 months ago
2008
IEEE
Due to rapid growth of the Internet technology and new scientific/technological advances, the number of applications that model data as graphs increases, because graphs have high e...
116
click to vote
SODA
1990
ACM
15 years 3 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
127
Voted
ATAL
2011
Springer
14 years 2 months ago
2011
Springer
In response to the Mumbai attacks of 2008, the Mumbai police have started to schedule a limited number of inspection checkpoints on the road network throughout the city. Algorithm...
121
Voted
NETWORKS
2010
15 years 28 days ago
2010
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...