Lecture Notes 8 : Sublinear Algorithms
نویسندگان
چکیده
This result was originally attributed to Nemhauser, Wolsey, and Fisher [4], but they only claimed this result without a proof. Jenkyns was the first to give a full proof of this result. We will discuss a simplified proof due to Calinescu et al [1]. Proof. If we have (α+1)-approximation for incremental oracle then approximation bound is αk+1. Let β ≤ 1 and β = 1/α. Then we want f(Greedy) ≥ β k + β f(OPT ).
منابع مشابه
The Essence of Constraint Propagation
We show that several constraint propagation algorithms (also called (local) consistency, consistency enforcing, Waltz, filtering or narrowing algorithms) are instances of algorithms that deal with chaotic iteration. To this end we propose a simple abstract framework that allows us to classify and compare these algorithms and to establish in a uniform way their basic properties. Note. This is a ...
متن کاملFactors affecting students tendency of Univercity students to Lecture Notes
Introduction: Many studies detected factors contributing to the students’ tendency to lecture notes. This study aimed at evaluating the factors affecting students tendency to lecture notes in Hormozgan University of Medical Sciences. Methods: In this descriptive study, 179 students from medicine, nursing & midwifery, health, and Paramedicine schools were selected through stratified random...
متن کاملAlgorithms for Selfish Agents Lecture Notes
This document contains lecture notes for a class on algorithms for selfish agents held by the authors at Università di Salerno in Spring 2003. Some lecture have been subsequently added.
متن کاملSublinear Time and Space Algorithms 2016B – Lecture 7 Sublinear-Time Algorithms for Sparse Graphs∗
Problem definition: Input: A graph represented (say) as the adjacency list for each vertex (or even just the degree of each vertex) Goal: Compute the average degree (equiv. number of edges) Concern: Seems to be impossible e.g. if all degrees ≤ 1, except possibly for a few vertices whose degree is about n. Theorem 1 [Feige, 2004]: There is an algorithm that estimates the average degree d of a co...
متن کاملSublinear Time and Space Algorithms 2016 B – Lecture 3 l 2 Frequency Moment and Point Queries , Heavy Hitters , and Compressed Sensing ∗
1. Run t = O(1/ε2) independent copies of Algorithm AMS, denoting their Z values by Y1, . . . , Yt, and output their mean Ỹ = ∑ j Y 2 j /t. Observe that the sketch (Y1, . . . , Yt) is still linear. ∗These notes summarize the material covered in class, usually skipping proofs, details, examples and so forth, and possibly adding some remarks, or pointers. The exercises are for self-practice and ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011