3020 search results - page 440 / 604 » Optimal partition trees |
354
click to vote
GECCO
2011
Springer
14 years 10 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
206
click to vote
COMBINATORICA
2011
14 years 6 months ago
2011
The topological Tverberg theorem states that for any prime power q and continuous map from a (d + 1)(q − 1)-simplex to Rd , there are q disjoint faces Fi of the simplex whose im...
172
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
216
click to vote
VLDB
2008
ACM
16 years 6 months ago
2008
ACM
Histograms are used to summarize the contents of relations into a number of buckets for the estimation of query result sizes. Several techniques (e.g., MaxDiff and V-Optimal) have ...
166
click to vote
STACS
2004
Springer
15 years 11 months ago
2004
Springer
OrthogonalVariableSpreadingFactor(OVSF)codesareusedinUMTStosharetheradiospectrum among several connections of possibly different bandwidth requirements. The combinatorial core of t...