Sciweavers

2137 search results - page 211 / 428
» Approximation Algorithms for Some Graph Partitioning Problem...
Sort
View
ISAAC
2004
Springer
137views Algorithms» more  ISAAC 2004»
15 years 11 months ago
The Polymatroid Steiner Problems
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Gruia Calinescu, Alexander Zelikovsky
WIOPT
2006
IEEE
16 years 13 days ago
Scheduling sensor activity for point information coverage in wireless sensor networks
Abstract— An important application of wireless sensor networks is to perform the monitoring missions, for example, to monitor some targets of interests at all times. Sensors are ...
Bang Wang, Kee Chaing Chua, Vikram Srinivasan, Wei...
HICSS
2008
IEEE
114views Biometrics» more  HICSS 2008»
16 years 27 days ago
On Structural Analysis of Large Networks
Containing much valuable information, networks such as the World Wide Web, social networks and metabolic networks draw increasingly attention in scientific communities. Network cl...
Nurcan Yuruk, Xiaowei Xu, Thomas A. J. Schweiger
JDA
2006
85views more  JDA 2006»
15 years 6 months ago
Average case analysis of DJ graphs
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
Johann Blieberger
LOPSTR
2004
Springer
15 years 11 months ago
Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
J. B. Wells, Boris Yakobowski