1647 search results - page 105 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
122
click to vote
IPL
2008
15 years 4 months ago
2008
We consider the problem known as MAX-SATISFY: given a system of m linear equations over the rationals, find a maximum set of equations that can be satisfied. Let r be the width of...
130
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
146
Voted
WAOA
2007
Springer
15 years 11 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...
144
click to vote
SIAMCOMP
1998
15 years 4 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
128
click to vote
WSC
2004
15 years 6 months ago
2004
This paper explores an approach to global, stochastic, simulation optimization which combines stochastic approximation (SA) with simulated annealing (SAN). SA directs a search of ...