3708 search results - page 80 / 742 » Approximating Betweenness Centrality |
WG
2001
Springer
15 years 5 months ago
2001
Springer
There exists a polynomial time algorithm to compute the pathwidth of outerplanar graphs [3], but the large exponent makes this algorithm impractical. In this paper, we give an alg...
127
Voted
CIAC
2010
Springer
15 years 3 months ago
2010
Springer
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...
88
Voted
WSC
2007
15 years 2 months ago
2007
There has long been a competition between simulation and optimization in the modeling of problems in transportation and logistics, machine scheduling and similar highdimensional p...
100
Voted
MLQ
2000
15 years 11 days ago
2000
The connection between similarity logic and the theory of closure operators is examined. Indeed one proves that the consequence relation defined in [14] can be obtained by composin...
ICDT
1995
ACM
15 years 4 months ago
1995
ACM
Partial information in databases can arise when information from several databases is combined. Even if each database is complete for some \world", the combined databases wil...