1158 search results - page 35 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
158
click to vote
FSTTCS
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. Shop scheduling problems are known to be notoriously intractable, both in theory and practice. In this paper we give a randomized approximation algorithm for flow shop s...
154
Voted
INFOCOM
2007
IEEE
15 years 10 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
IPL
2000
15 years 4 months ago
2000
An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...
129
click to vote
COR
2006
15 years 4 months ago
2006
This paper considers the break minimization problem in sports timetabling. The problem is to find, under a given timetable of a round-robin tournament, a home-away assignment that...
135
click to vote
EUROPAR
2010
Springer
15 years 4 months ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...