2957 search results - page 202 / 592 » The Complexity of Polynomial-Time Approximation |
142
click to vote
SCHEDULING
2008
15 years 5 months ago
2008
In this paper we consider the problem of scheduling n jobs on a single machine, where the jobs are processed in batches and the processing time of each job is a step function depe...
152
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
148
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
We consider the problem of broadcasting a large message in a large scale distributed platform. The message must be sent from a source node, with the help of the receiving peers whi...
191
click to vote
WAOA
2010
Springer
15 years 4 months ago
2010
Springer
We study an extension of the unit-demand pricing problem in which the seller may offer bundles of items. If a customer buys such a bundle she is guaranteed to get one item out of i...
216
click to vote
ALGOSENSORS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...