117 search results - page 10 / 24 » On the directed Full Degree Spanning Tree problem |
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
ESA
2009
Springer
15 years 4 months ago
2009
Springer
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
CONSTRAINTS
2008
14 years 9 months ago
2008
The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requ...
101
click to vote
TSMC
2010
14 years 4 months ago
2010
Abstract--This paper considers a second-order consensus problem for multiagent systems with nonlinear dynamics and directed topologies where each agent is governed by both position...
IPPS
2005
IEEE
15 years 3 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...