Sciweavers

970 search results - page 134 / 194
» On encodings of spanning trees
Sort
View
STACS
2010
Springer
15 years 5 months ago
Long Non-crossing Configurations in the Plane
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
Noga Alon, Sridhar Rajagopalan, Subhash Suri
ATAL
2009
Springer
15 years 4 months ago
Adaptive price update in distributed Lagrangian relaxation protocol
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
Katsutoshi Hirayama, Toshihiro Matsui, Makoto Yoko...
IWPEC
2009
Springer
15 years 4 months ago
What Makes Equitable Connected Partition Easy
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A...
MIDDLEWARE
2007
Springer
15 years 4 months ago
A Utility-Aware Middleware Architecture for Decentralized Group Communication Applications
Abstract. The success of Internet telephony services like Skype illustrates the feasibility of utilizing unstructured Peer-to-Peer (P2P) networks as an economical platform for supp...
Jianjun Zhang, Ling Liu, Lakshmish Ramaswamy, Gong...
IPPS
2006
IEEE
15 years 4 months ago
Battery-aware router scheduling in wireless mesh networks
Wireless mesh networks recently emerge as a flexible, low-cost and multipurpose networking platform with wired infrastructure connected to the Internet. A critical issue in mesh ...
Chi Ma, Zhenghao Zhang, Yuanyuan Yang