1729 search results - page 238 / 346 » On Bounds for the k-Partitioning of Graphs |
153
click to vote
IPL
2002
15 years 6 months ago
2002
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
163
click to vote
IPL
2002
15 years 6 months ago
2002
We deal with the problem of storing a set of K elements that are taken from a large universe of size N, such that membership in the set can be determined with high probability by ...
178
click to vote
IPL
1998
15 years 6 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...
196
click to vote
MST
2002
15 years 6 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...
165
click to vote
TCS
1998
15 years 6 months ago
1998
![Threshold Dominating Sets and an Improved Characterization of W[2]](http://sciweavers.com/files/imagecache/thumbnail/imagecache/threshold_dominating_sets_and_an_improved_characterization_of_w_2_TCS_1998.jpg "Threshold Dominating Sets and an Improved Characterization of W[2]")
The Threshold Dominating Set problem is that of determining for a graph G = (V, E) whether there is a subset V ⊆ V of size k, such that for each vertex v ∈ V there are at leas...