Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
All-norm approximation algorithms
Azar Y., Epstein L., Richter Y., Woeginger G. Journal of Algorithms52 (2):120-133,2004.Type:Article
Date Reviewed: Nov 11 2004

In optimization problems, especially in scheduling problems for different measures, there might be different optimal solutions. In this work, the authors introduce the concept of an all-norm ρ-approximation algorithm for the problem of scheduling in the restricted assignment model for different lp norms. This provides one solution that guarantees ρ- approximation to all lp norms.

Reviewer:  Adem Kilicman Review #: CR130402 (0504-0484)
Bookmark and Share
 
Approximation (G.1.2 )
 
 
Elementary Function Approximation (G.1.2 ... )
 
 
Sequencing And Scheduling (F.2.2 ... )
 
 
Nonnumerical Algorithms And Problems (F.2.2 )
 
Would you recommend this review?
yes
no
Other reviews under "Approximation": Date
Computing surfaces of constant mean curvature with singularities
Hewgill D. Computing 32(1): 81-92, 1984. Type: Article
Mar 1 1985
A method for the calculation of eigenfunction expansions
Michell J., Drake J., Bracho S. Mathematics and Computers in Simulation XXVI(5): 443-447, 1984. Type: Article
May 1 1985
Calculation of special functions: the gamma function, the exponential integrals and error-like functions
van der Laan C., Temme N., Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands, 1984. Type: Book (9789789061962779)
Jan 1 1986
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy