Refael Hassin, Samir Khuller  Home/Search
Context Related
| math.tau.ac.il/~hassin/z.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: math.tau.ac.il/~hassin/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Approximation algorithms for NP -hard optimization problems have been widely studied for over three decades. Most of these measure the quality of the solution produced by taking the ratio of the cost of the solution produced by the algorithm to the cost of an optimal solution. In certain cases, this ratio may not be very meaningful { for example, if the ratio of the worst solution to the best solution is at most some constant , then an approximation algorithm with factor may in fact... (Update)
Similar documents based on text: More All
0.2: A Simple Efficient Approximation Scheme for the Restricted.. - Lorenz, Raz (1999) (Correct)
0.1: z-Approximations - Hassin, Khuller (2001) (Correct)
0.1: Approximation Algorithms with Bounded Performance.. - Guttmann-Beck.. (Correct)
BibTeX entry: (Update)
R. Hassin and S. Khuller, "Z-approximations," Journal of Algorithms 41 (2001) 429442. http://citeseer.ist.psu.edu/hassin01zapproximations.html More
@misc{ hassin01zapproximations,
author = "R. Hassin and S. Khuller",
title = "Z-approximations",
text = "R. Hassin and S. Khuller, Z-approximations, Journal of Algorithms 41 (2001)
429442.",
year = "2001",
url = "citeseer.ist.psu.edu/hassin01zapproximations.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1989
957 The Probabilistic Method (context) - Alon, Spencer - 1992
318 Approximation algorithms for NP-hard problems (context) - Hochbaum - 1996
107 complete approximation problems (context) - Sahni, Gonzalez - 1976
106 approximation algorithms for MAX-CUT and MAX-2-SAT (context) - Goemans, Williamson - 1994
104 Approximating maximum independent sets by excluding subgraph.. - Boppana, Halld - 1992
88 The traveling salesman problem with distances one and two (context) - Papadimitriou, Yannakakis - 1993
71 Vertex packing: structural properties and algorithms (context) - Nemhauser, Trotter - 1975
52 A local ratio theorem for approximating the weighted vertex .. (context) - Bar-Yehuda, Even - 1985
41 Structure preserving reductions among convex optimization pr.. (context) - Ausiello, D'Atri et al. - 1980
36 The complexity of approximating a nonlinear program - Bellare, Rogaway - 1995
34 Approximation algorithms for some routing problems (context) - Frederickson, Hecht et al. - 1978
33 Local search and the local structure of NP-complete problems (context) - Grover - 1992
30 A linear time approximation algorithm for the weighted verte.. (context) - Bar-Yehuda, Even - 1981
21 Clique is hard to approximate within n (context) - astad - 1996
[Article contains additional citations not shown here]
Documents on the same site (http://www.math.tau.ac.il/~hassin/): More
The Scheduling of Maintenance Service - Anily, Glass, Hassin (1995) (Correct)
An Approximation Algorithm for Maximum Packing of 3-Edge Paths - Hassin, Rubinstein (1997) (Correct)
On the Advantage of Being the First Server - Refael Hassin (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC