2137 search results - page 246 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
156
click to vote
UC
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
193
click to vote
IJCNN
2000
IEEE
15 years 10 months ago
2000
IEEE
eresting web-available abstracts and papers on clustering: An Analysis of Recent Work on Clustering Algorithms (1999), Daniel Fasulo : This paper describes four recent papers on cl...
165
click to vote
IPPS
2005
IEEE
15 years 12 months ago
2005
IEEE
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...
144
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...
171
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
The transportation planning (TP) is well-known basic network problem. However, for some real-world applications, it is often that the TP model is extended to satisfy other additio...