Sciweavers

365 search results - page 38 / 73
» On the Crossing Spanning Tree Problem
Sort
View
SIGCOMM
2009
ACM
14 years 2 months ago
CrossTalk: scalably interconnecting instant messaging networks
We consider the problem of interconnecting a simple type of social network: Instant Messaging services. Today, users are members of various IM communities such as AOL, Yahoo, and ...
Marti A. Motoyama, George Varghese
PR
2007
81views more  PR 2007»
13 years 7 months ago
Graph embedding using tree edit-union
In this paper we address the problem of how to learn a structural prototype that can be used to represent the variations present in a set of trees. The prototype serves as a patte...
Andrea Torsello, Edwin R. Hancock
ALENEX
2001
101views Algorithms» more  ALENEX 2001»
13 years 9 months ago
CNOP - A Package for Constrained Network Optimization
Abstract. We present a generic package for resource constrained network optimization problems. We illustrate the flexibility and the use of our package by solving four applications...
Kurt Mehlhorn, Mark Ziegelmann
IPCO
2001
166views Optimization» more  IPCO 2001»
13 years 9 months ago
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
Fabián A. Chudak, Tim Roughgarden, David P....
SAC
2009
ACM
14 years 15 days ago
Autonomous networked robots for the establishment of wireless communication in uncertain emergency response scenarios
During a disaster, emergency response operations can benefit from the establishment of a wireless ad hoc network. We propose the use of autonomous robots that move inside a disas...
Stelios Timotheou, Georgios Loukas