Sciweavers

1647 search results - page 55 / 330
» Improved Randomized Approximation Algorithms for Lot-Sizing ...
Sort
View
133
Voted
FOCS
2007
IEEE
15 years 11 months ago
On the Advantage over Random for Maximum Acyclic Subgraph
In this paper we present a new approximation algorithm for the Max Acyclic Subgraph problem. Given an instance where the maximum acyclic subgraph contains 1/2 + δ fraction of all...
Moses Charikar, Konstantin Makarychev, Yury Makary...
DAM
2007
91views more  DAM 2007»
15 years 4 months ago
A note on the precedence-constrained class sequencing problem
We give a short proof of a result of Tovey [6] on the inapproximability of a scheduling problem known as precedence constrained class sequencing. In addition, we present an approxi...
José R. Correa, Samuel Fiorini, Nicol&aacut...
148
Voted
TSP
2008
115views more  TSP 2008»
15 years 4 months ago
Approximation Bounds for Semidefinite Relaxation of Max-Min-Fair Multicast Transmit Beamforming Problem
Consider a downlink multicast scenario where a base station equipped with multiple antennas wishes to simultaneously broadcast a number of signals to some given groups of users ove...
Tsung-Hui Chang, Zhi-Quan Luo, Chong-Yung Chi
CCCG
2010
15 years 6 months ago
The traveling salesman problem for lines and rays in the plane
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. In the path variant, we...
Adrian Dumitrescu
IPL
2007
94views more  IPL 2007»
15 years 4 months ago
The finite horizon investor problem with a budget constraint
We study a model that incorporates a budget constraint in a decision making problem. Our goal is to maximize the expected wealth, where in each time period we can either stop the ...
Asaf Levin