6598 search results - page 1043 / 1320 » Graph Theory with Applications |
239
click to vote
FSTTCS
1993
Springer
15 years 10 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
156
click to vote
ESA
1994
Springer
15 years 10 months ago
1994
Springer
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
164
click to vote
ISCA
1992
IEEE
15 years 10 months ago
1992
IEEE
A quantitative analysis of program execution is essential to the computer architecture design process. With the current trend in architecture of enhancing the performance of unipr...
193
click to vote
ACMICEC
2007
ACM
15 years 10 months ago
2007
ACM
An important problem in search engine advertising is keyword1 generation. In the past, advertisers have preferred to bid for keywords that tend to have high search volumes and hen...
173
click to vote
EVOW
2010
Springer
15 years 10 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...