Sciweavers

279 search results - page 46 / 56
» Degree-bounded minimum spanning trees
Sort
View
IWPEC
2009
Springer
14 years 1 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...
ADHOC
2005
102views more  ADHOC 2005»
13 years 7 months ago
Localized LMST and RNG based minimum-energy broadcast protocols in ad hoc networks
In the minimum energy broadcasting problem, each node adjusts its transmission power to minimize the total energy consumption while still guaranteeing the full coverage of the net...
Julien Cartigny, François Ingelrest, David ...
ICALP
2009
Springer
14 years 7 months ago
Limits and Applications of Group Algebras for Parameterized Problems
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
Ioannis Koutis, Ryan Williams
GLOBECOM
2009
IEEE
13 years 11 months ago
R-Code: Network Coding Based Reliable Broadcast in Wireless Mesh Networks with Unreliable Links
Broadcast is an important primitive in wireless mesh networks (WMNs). Applications like network-wide software update require reliable reception of the content with low-latency and ...
Zhenyu Yang, Ming Li, Wenjing Lou
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
13 years 8 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson