1647 search results - page 100 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
140
click to vote
AAAI
2007
15 years 7 months ago
2007
In recent years, the size of combinatorial applications and the need to produce high-quality solutions quickly have increased steadily, providing significant challenges for optim...
157
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
171
click to vote
ICALP
2004
Springer
15 years 10 months ago
2004
Springer
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
274
click to vote
DAC
2011
ACM
14 years 4 months ago
2011
ACM
In this paper, a new sparse approximation technique is proposed for incremental power grid analysis. Our proposed method is motivated by the observation that when a power grid net...
144
Voted
EOR
2008
15 years 4 months ago
2008
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...