1647 search results - page 88 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
131
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
We consider the problem of designing controllers for nonholonomic mobile robots converging to the source (minimum) of a field. In addition to the mobility constraints posed by the ...
147
Voted
IFIP
2004
Springer
15 years 10 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
142
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
197
click to vote
PODS
2011
ACM
14 years 7 months ago
2011
ACM
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
153
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...