Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

68

Voted

SODA
1997
ACM

favoriteEmaildiscussreport

120views Algorithms» more SODA 1997»

Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem

14 years 10 months ago

Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem

Download www.math.tu-berlin.de

Martin Skutella

Real-time Traffic

Algorithms | SODA 1997 |

claim paper

Related Content

» Improved Approximation Algorithm for Connected Facility Location Problems

» Paired Approximation Problems and Incompatible Inapproximabilities

» Fast Approximate Wavelet Tracking on Streams

» Solving discrete resource allocation problems using the Simultaneous Perturbation Stochast...

» Discretization of the Radon transform and of its inverse by spline convolutions

» Improved PrimalDual Approximation Algorithm for the Connected Facility Location Problem

» An Approach to Polygonal Approximation of Digital Curves Based on Discrete Particle Swarm ...

» A SpaceTime Tradeoff for Permutation Problems

» Some babystep giantstep algorithms for the low hamming weight discrete logarithm problem

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	1997
Where	SODA
Authors	Martin Skutella

Comments (0)