667 search results - page 44 / 134 » Approximation algorithms for connected facility location pro... |
132
Voted
CDC
2008
IEEE
15 years 7 months ago
2008
IEEE
— The assignment problem constitutes one of the fundamental problems in the context of linear programming. Besides its theoretical significance, its frequent appearance in the a...
103
Voted
LATIN
2004
Springer
15 years 5 months ago
2004
Springer
We consider the problem of protein folding in the HP model on the 3D square lattice. This problem is combinatorially equivalent to folding a string of 0’s and 1’s so that the s...
107
click to vote
WAOA
2007
Springer
15 years 6 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
119
Voted
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— Two fundamental functions of the sensor nodes in a wireless sensor network are to sense its environment and to transmit sensed information to a basestation. One approach to pro...
116
click to vote
WADS
2005
Springer
15 years 6 months ago
2005
Springer
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...