4860 search results - page 307 / 972 » SNPs Problems, Complexity, and Algorithms |
158
click to vote
SWAT
2004
Springer
15 years 12 months ago
2004
Springer
The seat reservation problem is the problem of assigning passengers to seats on a train with n seats and k stations enroute in an online manner. The performance of algorithms for t...
201
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
294
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
Monitoring extreme values (MAX or MIN) is a fundamental problem in wireless sensor networks (and in general, complex dynamic systems). This problem presents very different algorit...
195
click to vote
AE
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
156
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
? An efficient and compact canonical form is proposed for the Boolean matching problem under permutation and complementation of variables. In addition an efficient algorithm for co...