1996 · 212 citations · 14 references
Theory Of ComputingComputational ScienceEngineeringData ScienceLower BoundAlert PreferencesExtremal Set TheoryBibliometricsComputational ComplexityCitation AnalysisComputer ScienceDiscrete MathematicsPreliminary VersionLn NApproximation TheoryImpact Factor
Article Free Access Share on A threshold of ln n for approximating set cover (preliminary version) Author: Uriel Feige Department of Applied Math and Computer Science, The Weizmann Institute, Rehovot 76100, Israel Department of Applied Math and Computer Science, The Weizmann Institute, Rehovot 76100, IsraelView Profile Authors Info & Claims STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of ComputingJuly 1996Pages 314–318https://doi.org/10.1145/237814.237977Published:01 July 1996Publication History 180citation721DownloadsMetricsTotal Citations180Total Downloads721Last 12 Months69Last 6 weeks5 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
14
On the hardness of approximating minimization problems
Carsten Lund, Mihalis Yannakakis · Journal of the ACM · 1994 · 882 citations · Full text