Many network applications that need to distribute content and data to a large number of clients use a hybrid scheme in which one (or more) multicast channel is used in parallel to...
Distributed problem solving by a multiagent system represents a promising approach to solving complex computational problems. However, many multiagent systems require certain degr...
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
: Many geometric problems like generalized Voronoi diagrams, medial axis computations and boundary evaluation involve computation and manipulation of non-linear algebraic primitive...
Shankar Krishnan, Mark Foskey, Tim Culver, John Ke...