355 search results - page 66 / 71 » On Central Spanning Trees of a Graph |
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
A fundamental task of data analysis is comprehending what distinguishes clusters found within the data. We present the problem of mining distinguishing sets which seeks to find s...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
Title of thesis: BOOTSTRAPPING FREE-SPACE OPTICAL NETWORKS Fang Liu, Master of Science, 2004 Thesis directed by: Professor Uzi Vishkin Department of Electrical and Computer Engine...
ECAI
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. Automated negotiation techniques have received considerable attention over the past decade, and much progress has been made in developing negotiation protocols and strate...
FSTTCS
2003
Springer
14 years 18 days ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...