Sciweavers

870 search results - page 7 / 174
» Constructions for Difference Triangle Sets
Sort
View
INFORMATICALT
2000
125views more  INFORMATICALT 2000»
13 years 7 months ago
An Algorithm for Construction of Test Cases for the Quadratic Assignment Problem
In this paper we present an algorithm for generating quadratic assignment problem (QAP) instances with known provably optimal solution. The flow matrix of such instances is constru...
Gintaras Palubeckis
ICDCS
2008
IEEE
14 years 1 months ago
Distributed Connected Dominating Set Construction in Geometric k-Disk Graphs
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
Kai Xing, Wei Cheng, E. K. Park, Shmuel Rotenstrei...
GLOBECOM
2006
IEEE
14 years 1 months ago
Efficient Construction of Weakly-Connected Dominating Set for Clustering Wireless Ad Hoc Networks
In most of the proposed clustering algorithms for wireless ad hoc networks, the cluster-heads form a dominating set in the network topology. A variant of dominating set which is mo...
Bo Han, Weijia Jia
GM
1999
Springer
13 years 11 months ago
Data-Dependent Triangulation in the Plane with Adaptive Knot Placement
In many applications one is concerned with the approximation of functions from a finite set of scattered data sites with associated function values. We describe a scheme for cons...
René Schätzl, Hans Hagen, James C. Bar...
CLASSIFICATION
2006
103views more  CLASSIFICATION 2006»
13 years 7 months ago
On the Complexity of Ordinal Clustering
Abstract. Given a set of pairwise distances on a set of n points, constructing an edge-weighted tree whose leaves are these n points such that the tree distances would mimic the or...
Rahul Shah, Martin Farach-Colton