3415 search results - page 588 / 683 » Lower Bounds for Kernelizations |
CORR
2007
Springer
13 years 10 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
CPC
1998
13 years 9 months ago
1998
For any Boolean functionf letL(f) be its formulasizecomplexityin the basis f^ 1g. For every n and every k n=2, we describe a probabilistic distribution on formulas in the basis f^...
IPL
1998
13 years 9 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
JMMA
2002
13 years 9 months ago
2002
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
MST
2002
13 years 9 months ago
2002
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...