Bin Fu Department of Computer Science

Slides:



Advertisements
Similar presentations
A threshold of ln(n) for approximating set cover By Uriel Feige Lecturer: Ariel Procaccia.
Advertisements

Chapter 11 Limitations of Algorithm Power Copyright © 2007 Pearson Addison-Wesley. All rights reserved.
PCPs and Inapproximability Introduction. My T. Thai 2 Why Approximation Algorithms  Problems that we cannot find an optimal solution.
Complexity 16-1 Complexity Andrei Bulatov Non-Approximability.
Computability and Complexity 23-1 Computability and Complexity Andrei Bulatov Search and Optimization.
Complexity 15-1 Complexity Andrei Bulatov Hierarchy Theorem.
Computability and Complexity 13-1 Computability and Complexity Andrei Bulatov The Class NP.
NP-complete and NP-hard problems Transitivity of polynomial-time many-one reductions Definition of complexity class NP –Nondeterministic computation –Problems.
Vertex Cover, Dominating set, Clique, Independent set
NP-complete and NP-hard problems
Time Complexity.
Chapter 11: Limitations of Algorithmic Power
Chapter 11 Limitations of Algorithm Power Copyright © 2007 Pearson Addison-Wesley. All rights reserved.
Approximation Algorithms Motivation and Definitions TSP Vertex Cover Scheduling.
Hardness Results for Problems P: Class of “easy to solve” problems Absolute hardness results Relative hardness results –Reduction technique.
Chapter 11 Limitations of Algorithm Power. Lower Bounds Lower bound: an estimate on a minimum amount of work needed to solve a given problem Examples:
Approximation Algorithms Department of Mathematics and Computer Science Drexel University.
Scott Perryman Jordan Williams.  NP-completeness is a class of unsolved decision problems in Computer Science.  A decision problem is a YES or NO answer.
Complexity Classes (Ch. 34) The class P: class of problems that can be solved in time that is polynomial in the size of the input, n. if input size is.
Approximation schemes Bin packing problem. Bin Packing problem Given n items with sizes a 1,…,a n  (0,1]. Find a packing in unit-sized bins that minimizes.
1 Introduction to Approximation Algorithms. 2 NP-completeness Do your best then.
Approximation Algorithms
CSC 413/513: Intro to Algorithms NP Completeness.
CSCI 2670 Introduction to Theory of Computing November 29, 2005.
Week 10Complexity of Algorithms1 Hard Computational Problems Some computational problems are hard Despite a numerous attempts we do not know any efficient.
1 Lower Bounds Lower bound: an estimate on a minimum amount of work needed to solve a given problem Examples: b number of comparisons needed to find the.
CSCI 3160 Design and Analysis of Algorithms Tutorial 10 Chengyu Lin.
On the Approximability of Geometric and Geographic Generalization and the Min- Max Bin Covering Problem Michael T. Goodrich Dept. of Computer Science joint.
1 Design and Analysis of Algorithms Yoram Moses Lecture 11 June 3, 2010
Non-Approximability Results. Summary -Gap technique -Examples: MINIMUM GRAPH COLORING, MINIMUM TSP, MINIMUM BIN PACKING -The PCP theorem -Application:
Instructor Neelima Gupta Table of Contents Class NP Class NPC Approximation Algorithms.
Computability Heap exercise. The class P. The class NP. Verifiers. Homework: Review RELPRIME proof. Find examples of problems in NP.
CSCI 2670 Introduction to Theory of Computing November 17, 2005.
Donghyun (David) Kim Department of Mathematics and Computer Science North Carolina Central University 1 Chapter 7 Time Complexity Some slides are in courtesy.
Computability NP complete problems. Space complexity. Homework: [Post proposal]. Find PSPACE- Complete problems. Work on presentations.
NP-Completness Turing Machine. Hard problems There are many many important problems for which no polynomial algorithms is known. We show that a polynomial-time.
1 CPSC 320: Intermediate Algorithm Design and Analysis July 30, 2014.
1 Approximation algorithms Algorithms and Networks 2015/2016 Hans L. Bodlaender Johan M. M. van Rooij TexPoint fonts used in EMF. Read the TexPoint manual.
NP Completeness Piyush Kumar. Today Reductions Proving Lower Bounds revisited Decision and Optimization Problems SAT and 3-SAT P Vs NP Dealing with NP-Complete.
Lecture. Today Problem set 9 out (due next Thursday) Topics: –Complexity Theory –Optimization versus Decision Problems –P and NP –Efficient Verification.
Introduction to NP Instructor: Neelima Gupta 1.
The NP class. NP-completeness Lecture2. The NP-class The NP class is a class that contains all the problems that can be decided by a Non-Deterministic.
Approximation algorithms
TU/e Algorithms (2IL15) – Lecture 11 1 Approximation Algorithms.
ICS 353: Design and Analysis of Algorithms NP-Complete Problems King Fahd University of Petroleum & Minerals Information & Computer Science Department.
The NP class. NP-completeness
NP-Complete Problems.
More NP-Complete and NP-hard Problems
P & NP.
Chapter 10 NP-Complete Problems.
8.3.2 Constant Distance Approximations
Independent Cascade Model and Linear Threshold Model
EMIS 8373: Integer Programming
Decision trees Polynomial-Time
Approximation algorithms
Path Coupling And Approximate Counting
Computability and Complexity
Independent Cascade Model and Linear Threshold Model
Lower Bound Theory.
Analysis and design of algorithm
ICS 353: Design and Analysis of Algorithms
Linear Programming Duality, Reductions, and Bipartite Matching
Polynomial time approximation scheme
Chapter 11 Limitations of Algorithm Power
CSE 6408 Advanced Algorithms.
Clustering.
Independent Cascade Model and Linear Threshold Model
Submodular Maximization with Cardinality Constraints
ADVANCED COMPUTATIONAL MODELS AND ALGORITHMS
Presentation transcript:

Partial Sublinear Time Approximation and Inapproximation for Maximum Coverage Bin Fu Department of Computer Science University of Texas Rio Grande Valley Texas, USA

Hard to find, Easy to check blind monkey

Hamiltonian Path Hamiltonian path goes through each node exactly once HAMPATH={G| G is a directed graph with a Hamiltonian path}

P versus NP Polynomial time: P: polynomial time decidable problems. NP: polynomial time verifiable problems.

Polynomial Time Verifier verifier V(w,c) w: input c: certificate of length poly(|w|). where |w| is length of w. For example, |C++|=3

Polynomial Time Verifier A verifier V(w,c) for a language L is an algorithm V, V(w,c) runs in polynomial time poly(|w|) for input w, and c with a polynomial length w is in L if and only if V(w,c) accepts for some c with a polynomial length.

Algorithms toward NP-hardness 1.Approximation algorithm 2. Fixed Parameter Algorithm 3.Heurisitc Algorithm

NP-Complete A problem H is NP-complete if for every B in NP, Every problem in NP can be reduced to an NP-complete problem in a polynomial time. NP NP-complete P

Polynomial Time Reduction Assume that A and B are two sets. A is polynomial time mapping reducible to A if a polynomial time computable function f exists such that

Introduction Approximation algorithms are used to get a solution close to the (optimal) solution of an optimization problem in polynomial time

Definition An algorithm is an α-approximation algorithm for an optimization problem Π if The algorithm runs in polynomial time. The algorithm always produces a solution that is within a factor of α of the optimal solution.

Maximum Cover (MC) A collection T of finite m sets S1, S2, …, Sm, and integer k. Find k of them with largest union.

Decision Version of Maximum Cover A collection T of finite m sets S1, S2, …, Sm, integers k and t. Decide if there are k sets from them with union size at least t.

c-Approximation for Max Opt. An approximation produces a solution T if

Example of Maximum Coverage Input: k=2 with sets: S1 = { 1, 2, 3 } S2 = { 2, 7, 8 } S3 = { 1, 4, 5, 6, 7, 8} S4 = { 4, 5, 6, 8 } Output: Optimal Solution is S1, S3

MC Hardness MC is NP-Hard The decision version of MC is NP-complete: Is it possible to find k sets with union size at least t?

Greedy Algorithm Repeat k times Pick one set to cover the largest number of uncovered elements

Greedy Algorithm Performance Approximation Ratio for MC via greedy For any fixed there is no poly. time ratio approximation to MC unless P=NP (Feige, J.ACM 1998).

Example of Maximum Coverage Step 1: Select the largest set S3 = { 1, 4, 5, 6, 7, 8} Step2: Select the set S1 such that S1-S3 is the largest.

Our Input Model Each Set : 1) Membership query ? 2) Generating a random element in 3) The size

Greedy Algorithm k times: Pick one set with largest number of uncovered elements Largest |B-A| B A

Approximate Union Union size Union size in MC B A

Input Size of Maximum Coverage S3 = { 1, 4, 5, 6, 7, 8} n=5, m=4 S4 = { 4, 5, 6, 8 }

Randomized Greedy Algorithm Approximate |B-A| using random samples from B Estimate the percentage to be in B-A B A

Randomized Greedy Algorithm Approximate |B-A| using random samples from B Estimate the percentage to be in B-A B A

Approximate |B-A| Let w be the random samples in B. Let t be the items in B-A among w samples. B A

Randomized Greedy Algorithm Accuracy B A

Approximate Assume A B

Approximate Proof

Randomized Greedy Algorithm Repeat k times Pick one set to cover approximate largest number of uncovered elements

Classical Ratio Analysis Let OPT be the optimal solution size. Let be selected via greedy. The first size Assume the union of first t sets

Classical Ratio Analysis The t+1-th set Assume the union of first t+1 sets

Classical Ratio Analysis Function is increasing. Limit Bound Ratio

Ratio Analysis Let OPT be the optimal solution size. Let be selected with Then

Ratio Analysis Let OPT be the optimal solution size. Let be selected. There is a

Ratio Analysis Let OPT be the optimal solution size. Let be selected with

Monte Carlo Algorithm Put the circle into a square A Generate n random points in A Compute the number of points m in the circle (m/n)*|A| is the approximate area size of the circle

Randomized algorithm blind monkey

Randomized algorithm blind monkey

Input length for Sorting Problem Input: a list of numbers: 5, 3, 1, 7, 6 Input length n=5 Output: the sorted list 1, 3, 5, 6, 7

Time: number of steps Super linear: n(log n) (sorting) Sublinear: log n (binary search at sorted list)

Input length for MC m: number of sets n: the number of elements in the biggest set The total input size can be mn

Partial Sublinear Time for MC for some functions f(.) or g(.)

Classical Algorithm Old algorithm time Approximation ratio

New Partial Sublinear Time Our algorithm time Approximation ratio

Hoeffiding Bound Therorem: Let be independent 0,1-random variables such that Then for , and

Hoeffiding Bound Therorem: Let be independent 0,1-random variables such that Then for , and

Chernoff Bound Therorem: Let be independent 0,1-random variables such that Then for , and

Chernoff Bound Therorem: Let be independent 0,1-random variables such that Then for , and

Union Bound Probability inequality:

Paper address arXiv https://arxiv.org/abs/1604.01421

Future work More partial sublinear time algorithms.

Thanks Question?