Constraint Satisfaction Problems

Save this PDF as:

Size: px
Start display at page:

Transcription

1 Lecture 13 Constraint Satisfaction Problems Now that we ve seen all the theory, let s move on to the applications, starting with CSPs. In fact, we begin with some examples of CSPs Examples Max-3-SAT. In this problem, the domain is {0, 1}; a collection of constraint types are disjunctions of the form {x i x j x k, x i x j x k, x i x j x k,..., x i x j x k, x i x j,..., x i x j, x i, x i } resulting in total of 14 constraint types. Max-Cut. Here, the domain is again {0, 1}, the collection of constraint types is simply {v i v j }. Intuitively, we have one such constraint for each edge in a given Max-Cut instance, and the goal is to label the vertices. Max-E3-Lin2. The problem deals with clauses of E xactly 3 variables mod 2. As the name suggests, the domain is again {0, 1}, and the constraint types are {x i + x j + x k = 0 mod 2, x i + x j + x k = 1 mod 2}. Order(10). Here, the domain is the set {0, 1, 2,..., 9}, and the constraint types include {x i < x j }. Now that we ve seen some examples of CSPs, lets get down to some useful notation Notation CSP Problem A general Constraint Satisfaction Problem (CSP) is accompanied by a domain D of size q, typically D = {0, 1,..., q 1} and a collection Γ of constraint types. Alternately, one could view Γ as a collection of relations R : D k {0, 1}, where k is the arity of the relation R. This relation evaluates to 1 if corresponding particular assignment satisfies the constraint. * Lecturer: Ryan O Donnell. Scribe: Ravishankar Krishnaswamy. 1

2 Together, the combination D and Γ form the CSP problem, typically denoted as CSP(Γ) (here the domain of the variables D is implicitly defined in Γ). For example, in Max-Cut, D = {0, 1} and Γ { }, where (a, b) = 1 a b CSP Instance Now that we ve seen how to describe problems, let s move on to describing specific instances of problems. A instance C CSP(Γ) over n variables is a weighted list of constraints C = (R, S) where R Γ is the constraint type, and S is the scope for R, i.e., it is an unordered k-tuple of distinct variables, where k is the arity of R. Note. Since we will only be dealing with finite instances (and focus on additive approximations) in this lecture, let us WLOG assume that the weights w C 0, and they sum to 1. In particular, this lets us view the problem instance as coming with a probability distribution over clauses, and so we can write C C to denote that C is chosen with probability w C. This view will substantially simplify the coming notation. Now for a small example. Consider the Max-3-SAT instance: 1/4 weight on x 1 x 3, 1/2 weight on x 2 x 3, and 1/4 weight on x 1 x 3 x 4. In the form we have stated above, the first constraint can be written as C = (R, S) where R(a, b) = 1 unless a = 0, b = 1, and the scope S = (x 2, x 3 ) (ordered) Algorithmic Assignment An assignment F : V D is said to satisfy a constraint C C if R(F (S)) = 1, i.e., apply the labels suggested by F to the variables in the scope S and check if that assignment satisfies R. Given this, we can define the value of this assignment as Val C (F ) = E [R(F (S)) (13.1) C=(R,S) C Finally, we also define Opt(C) = max F Val C (F ). Using this definition, we say that an instance C is satisfiable if Opt(C) = 1. Note. Since our view of satisfiability is of the form given in (13.1), we don t need to constrain R to have range {0, 1}. Indeed, we could allow range of [0, 1, these are called fuzzy predicates and the CSP is called a vcsp, for value-csp Approximation Algorithm We view an algorithm with the following useful yardstick, albeit somewhat non-standard. Definition An algorithm (α, β)-approximates a CSP problem CSP(Γ) if for all instances with Opt β, the algorithm finds an assignment with value at least α. Here s the above notation in action for the Max-Cut problem. 2

3 Algorithm Guarantee Range Greedy ( 1, β) for all β 2 Random ( 1, β) for all β 2 GW-Algorithm (0.878β, β) for all β Greedy (1, 1) for β = 1 (bipartite graph) Exercise. The above chart shows that greedy is good if Opt is 1, i.e., the graph is bipartite. Is there a graph where Opt 1 ɛ, yet the greedy algorithm only gets value ɛ? Now that we re familiar with this notation, let s look at 3SAT, and begin with some hardness results. First is the fundamental NP-completeness result cast in our framework. Theorem 13.2 (Cook-Levin). (1, 1)-approximating 3-SAT is NP-Hard. Subsequently, Håstad showed in his seminal paper [Hås01 the following result. Theorem 13.3 (Håstad). (7/8 + ɛ, 1)-approximating 3-SAT is NP-Hard for every ɛ > 0. Now let s see what we know from the positive side. Indeed, we would expect the trivial random assignment algorithm to get 7/8th fraction of all clauses, right? Unfortunately, while this intuition is right if all clauses had exactly 3 literals, it breaks down if there are fewer! In particular, this assignment gets only 1/2 fraction of the clauses on the trivial instance where there is only one clause x 1. So the random algorithm can be easily seen to be (1/2, β)-approximation for any β. However, if we restrict our attention to the Max-E3-SAT problem, the random assignment algorithm is a 7/8, β)-approximation for all β. While this result along with Håstad s show that there is essentially no gap between the hardness and the easiness for Max-E3-SAT instances, the same is not true of all CSPs, including general 3SAT instances. In the next two lectures, we will address the problem of using LPs and SDPs to design CSP algorithms. This will familiarize us with using a hierarchy of tools in this paradigm, each a stronger technique than the previous. 1. Trivial Random Assignment 2. Linear Programming Relaxations (*) 3. Semidefinite Programming Relaxations 4. LPs/SDPs with lifted hierarchy constraints [Sherali-Adams, Lasserre, etc. (see, e.g., [GLS88 In this lecture, however, we will focus on using LPs to attack (well, approximately solve) CSPs. 3

4 13.3 Canonical LP Relaxation Suppose we are given an instance C CSP(Γ). Then our canonical LP has variables µ v [ for each v and λ C [ for all constraints. µ v denotes the probability distribution over labels for variable v, and λ C denotes the probability distribution over local assignments for constraint C. Indeed, if C = (R, S), λ C is a probability distribution over D S. We then write the following linear constraints in our canonical LP. 1. µ v is a prob. distribution on D for all v V. We encode this by the constraint µ v [0 + µ v [ µ v [q 1 = 1 and µ v [i λ C is a prob. distribution on D S (i.e., local assignments) for all C C. For example, if some constraint had a scope S = (x 1, x 2 ), the LP would encode the constraint λ C [x 1 0, x λ C [x 1 0, x λ C [x 1 1, x 2 1 = 1 and λ C [ 0. It is easy to see that we can encode these constraints in a similar manner to the µ distribution linear constraint. 3. Objective Function. Our objective is easy to describe: max LPVal which is the total fractional extent to which the constraints are satisfied. Mathematically, this expression is [ LPVal = E C C E [R(L(S)) L λ C As is, however, there is a big issue with the LP. That is, regardless of the problem and regardless of the instance, Opt(LP ) = 1. Indeed, there is nothing tying the λ C s and the µ v s. The LP solution could pick any local assignment A which satisfies a constraint and set λ C [A := 1. To resolve this issue, we put in one more set of constraints. 4. Consistency Constraints. We write down the following constraint for every C C, for every v V, and for every label l D: Pr [L(v) = l = Pr [L = l L λ C L µ v For example, if C had scope (x 1, x 2 ), then the above constraint would look like λ C [x 1 3, x λ C [x 1 3, x λ C [x 1 3, x 2 q 1 = µ x1 [3 for the choice of C, x 1 and label 3. Note. In the above formulation, two constraints could have the same scope but the LP can assign different distributions over local assignments. We could put in constraints which enforce that if the scope is the same, then the local distribution is also the same, but these it is somewhat difficult using them in a meaningful way when we 4

5 are rounding the fractional solution. Another way of strengthening the LP could be to ensure that pairwise marginals are preserved instead of just µ v. In fact, it is these kinds of constraints (albeit more methodically) which form the basis of LP/SDP hierarchies. Theorem The above LP is a relaxation for the problem CSP (Γ) Proof. It is easy to see that Opt, the optimal assignment induces a feasible LP solution of value Opt, and so the LP is a relaxation. In particular we have Opt(C) LPOpt(C) 1. Having formulated the LP, the immediate next question is if the LP is any good? That is, can we extract a good integral solution of approximate value of LPOpt? This is our focus in the coming section Randomized Rounding for Max-k-SAT Suppose we are given an instance C, with the optimal LP solution L = (λ C, µ v). The main question is how do we round this fractional solution to obtain an integer solution? The answer, (at least for this problem) is randomized rounding. That is, for each variable v, define { 0 with probability µ F (v) = v [0 1 with probability µ v[1 Let us now study the expected value of this randomized solution, i.e., E F [Val C [F. To this end, notice that E [Val C [F = E [Pr [F satisfies C F F C C [ = E Pr [F satisfies C C C F (13.2) (13.3) In the equality above, we have switched the order of taking expectation, which simply amounts to changing the order of summation. This now lets us focus on the algorithm s performance term-by-term. Indeed, let us fix some C C and look at Pr F [F satisfies C? For example, suppose C = x 1 x 3 x 10, say. Then the probability that F does not satisfy C is precisely the probability that x 1 = 0 and x 3 = 0 and x 10 = 1. Since these choices are independent, we get Pr [F satisfies C = 1 µ 1[0µ 3[0µ 10[1 The function b C. And in general, suppose the constraint C has scope S. Let b C : S {0, 1} denote the bad assignment for S w.r.t C, i.e., b C (v) is the unique assignment to variable v 5

6 which makes C unsatisfied. In the above example, b C (x 1 ) = 0, b C (x 3 ) = 0 and b C (x 10 ) = 1. In this notation, we have Pr [F satisfies C = 1 v S µ v [b C (v) (13.4) Now, it remains to compare this expected value with that of the LP. Can the LP fetch much profit more from each clause? To answer this, let us consider the contribution of λ C to the LP value. To this end, define p C := Pr L λ C = Pr L λ C v S = v S [L satisfies C (13.5) [ {L(v) b C (v)} (13.6) v S Pr [{L(v) b C (v)} (13.7) L λ C (1 µ v [b C (v)) (13.8) Here, the final step used the consistent marginals constraint of the LP for the constraint C, variable v and label b C (v) inside each term of the summation. So it remains to compare the values in (13.4) and (13.8). Looking at the two forms, it suggests an application of the AM-GM inequality. With this in mind, let us express (13.4) as Pr [F satisfies C = 1 v S µ v [b C (v) (13.9) = 1 GM v S {µ v(b c (v))} S (13.10) 1 AM v S {µ v(b c (v))} S (13.11) = 1 (1 AM v S {1 µ v(b c (v))}) S (13.12) ( 1 1 p ) S C (13.13) S Now for a plot (which compares the expression in (13.13) with the value p C ) to complete the story. 6

7 Figure 13.1: Comparing p C (X axis) with Pr F [F satisfies C (Y axis) So as you can see, the worst case limit happens when S, in which case the ratio reaches a limit of 0.63 = 1 1/e. Using this worst case (proof by picture) we get So we get E [Val C [F = E [Pr [F satisfies C (13.14) F F C C [ = E Pr [F satisfies C (13.15) C C F ( 1 1 ) E C C [p C (13.16) e ( = 1 1 ) LPVal(L ) (13.17) e ( ) = LPOpt(C) (13.18) 1 1 e ( 1 1 e ) Opt(C) (13.19) Theorem Randomized rounding is a ((1 1/e)β, β)-approximation, for Max-SAT, for any β. We note that a slightly smarter rounding can give a 3/4 approximation [GW94, and also that SDPs do even better. But that s a story for another day. 7

8 Bibliography [GLS88 Martin Grötschel, Lásló Lovász, and Alexander Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer, [GW94 Michel X. Goemans and David P. Williamson. New 3/4-approximation algorithms for max sat [Hås01 Johan Håstad. Some optimal inapproximability results. J. ACM, 48: , July

Nan Kong, Andrew J. Schaefer. Department of Industrial Engineering, Univeristy of Pittsburgh, PA 15261, USA

A Factor 1 2 Approximation Algorithm for Two-Stage Stochastic Matching Problems Nan Kong, Andrew J. Schaefer Department of Industrial Engineering, Univeristy of Pittsburgh, PA 15261, USA Abstract We introduce

ARTICLE IN PRESS. European Journal of Operational Research xxx (2004) xxx xxx. Discrete Optimization. Nan Kong, Andrew J.

A factor 1 European Journal of Operational Research xxx (00) xxx xxx Discrete Optimization approximation algorithm for two-stage stochastic matching problems Nan Kong, Andrew J. Schaefer * Department of

Energy Efficient Monitoring in Sensor Networks

Energy Efficient Monitoring in Sensor Networks Amol Deshpande, Samir Khuller, Azarakhsh Malekian, Mohammed Toossi Computer Science Department, University of Maryland, A.V. Williams Building, College Park,

P versus NP, and More

1 P versus NP, and More Great Ideas in Theoretical Computer Science Saarland University, Summer 2014 If you have tried to solve a crossword puzzle, you know that it is much harder to solve it than to verify

Approximation Algorithms Chapter Approximation Algorithms Q. Suppose I need to solve an NP-hard problem. What should I do? A. Theory says you're unlikely to find a poly-time algorithm. Must sacrifice one

! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. #-approximation algorithm.

Approximation Algorithms 11 Approximation Algorithms Q Suppose I need to solve an NP-hard problem What should I do? A Theory says you're unlikely to find a poly-time algorithm Must sacrifice one of three

Analysis of Approximation Algorithms for k-set Cover using Factor-Revealing Linear Programs

Analysis of Approximation Algorithms for k-set Cover using Factor-Revealing Linear Programs Stavros Athanassopoulos, Ioannis Caragiannis, and Christos Kaklamanis Research Academic Computer Technology Institute

! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. !-approximation algorithm.

Approximation Algorithms Chapter Approximation Algorithms Q Suppose I need to solve an NP-hard problem What should I do? A Theory says you're unlikely to find a poly-time algorithm Must sacrifice one of

Lecture 7: NP-Complete Problems

IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Basic Course on Computational Complexity Lecture 7: NP-Complete Problems David Mix Barrington and Alexis Maciel July 25, 2000 1. Circuit

CSC 373: Algorithm Design and Analysis Lecture 16

CSC 373: Algorithm Design and Analysis Lecture 16 Allan Borodin February 25, 2013 Some materials are from Stephen Cook s IIT talk and Keven Wayne s slides. 1 / 17 Announcements and Outline Announcements

Approximation Algorithms

Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NP-Completeness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms

A Sublinear Bipartiteness Tester for Bounded Degree Graphs

A Sublinear Bipartiteness Tester for Bounded Degree Graphs Oded Goldreich Dana Ron February 5, 1998 Abstract We present a sublinear-time algorithm for testing whether a bounded degree graph is bipartite

npsolver A SAT Based Solver for Optimization Problems

npsolver A SAT Based Solver for Optimization Problems Norbert Manthey and Peter Steinke Knowledge Representation and Reasoning Group Technische Universität Dresden, 01062 Dresden, Germany peter@janeway.inf.tu-dresden.de

The Goldberg Rao Algorithm for the Maximum Flow Problem

The Goldberg Rao Algorithm for the Maximum Flow Problem COS 528 class notes October 18, 2006 Scribe: Dávid Papp Main idea: use of the blocking flow paradigm to achieve essentially O(min{m 2/3, n 1/2 }

SUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by

SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples

Cloud Computing is NP-Complete

Working Paper, February 2, 20 Joe Weinman Permalink: http://www.joeweinman.com/resources/joe_weinman_cloud_computing_is_np-complete.pdf Abstract Cloud computing is a rapidly emerging paradigm for computing,

8.1 Min Degree Spanning Tree

CS880: Approximations Algorithms Scribe: Siddharth Barman Lecturer: Shuchi Chawla Topic: Min Degree Spanning Tree Date: 02/15/07 In this lecture we give a local search based algorithm for the Min Degree

9th Max-Planck Advanced Course on the Foundations of Computer Science (ADFOCS) Primal-Dual Algorithms for Online Optimization: Lecture 1

9th Max-Planck Advanced Course on the Foundations of Computer Science (ADFOCS) Primal-Dual Algorithms for Online Optimization: Lecture 1 Seffi Naor Computer Science Dept. Technion Haifa, Israel Introduction

Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3

Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3 Cristina Bazgan a and Zsolt Tuza b,c,d a LAMSADE, Université Paris-Dauphine, Place du Marechal de Lattre de Tassigny, F-75775 Paris

THE PROBLEM WORMS (1) WORMS (2) THE PROBLEM OF WORM PROPAGATION/PREVENTION THE MINIMUM VERTEX COVER PROBLEM

1 THE PROBLEM OF WORM PROPAGATION/PREVENTION I.E. THE MINIMUM VERTEX COVER PROBLEM Prof. Tiziana Calamoneri Network Algorithms A.y. 2014/15 2 THE PROBLEM WORMS (1)! A computer worm is a standalone malware

Large induced subgraphs with all degrees odd

Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order

CSC2420 Fall 2012: Algorithm Design, Analysis and Theory

CSC2420 Fall 2012: Algorithm Design, Analysis and Theory Allan Borodin November 15, 2012; Lecture 10 1 / 27 Randomized online bipartite matching and the adwords problem. We briefly return to online algorithms

Max Flow, Min Cut, and Matchings (Solution)

Max Flow, Min Cut, and Matchings (Solution) 1. The figure below shows a flow network on which an s-t flow is shown. The capacity of each edge appears as a label next to the edge, and the numbers in boxes

Permutation Betting Markets: Singleton Betting with Extra Information

Permutation Betting Markets: Singleton Betting with Extra Information Mohammad Ghodsi Sharif University of Technology ghodsi@sharif.edu Hamid Mahini Sharif University of Technology mahini@ce.sharif.edu

On the effect of forwarding table size on SDN network utilization

IBM Haifa Research Lab On the effect of forwarding table size on SDN network utilization Rami Cohen IBM Haifa Research Lab Liane Lewin Eytan Yahoo Research, Haifa Seffi Naor CS Technion, Israel Danny Raz

An Approximation Algorithm for Bounded Degree Deletion

An Approximation Algorithm for Bounded Degree Deletion Tomáš Ebenlendr Petr Kolman Jiří Sgall Abstract Bounded Degree Deletion is the following generalization of Vertex Cover. Given an undirected graph

A Working Knowledge of Computational Complexity for an Optimizer

A Working Knowledge of Computational Complexity for an Optimizer ORF 363/COS 323 Instructor: Amir Ali Ahmadi TAs: Y. Chen, G. Hall, J. Ye Fall 2014 1 Why computational complexity? What is computational

Random graphs with a given degree sequence

Sourav Chatterjee (NYU) Persi Diaconis (Stanford) Allan Sly (Microsoft) Let G be an undirected simple graph on n vertices. Let d 1,..., d n be the degrees of the vertices of G arranged in descending order.

A New Generic Digital Signature Algorithm

Groups Complex. Cryptol.? (????), 1 16 DOI 10.1515/GCC.????.??? de Gruyter???? A New Generic Digital Signature Algorithm Jennifer Seberry, Vinhbuu To and Dongvu Tonien Abstract. In this paper, we study

Optimal Monitoring in Multi-Channel Multi-Radio Wireless Mesh Networks

Optimal Monitoring in Multi-Channel Multi-Radio Wireless Mesh Networks Dong-Hoon Shin and Saurabh Bagchi Dependable Computing Systems Lab School of Electrical and Computer Engineering Purdue University

On the Relationship between Classes P and NP

Journal of Computer Science 8 (7): 1036-1040, 2012 ISSN 1549-3636 2012 Science Publications On the Relationship between Classes P and NP Anatoly D. Plotnikov Department of Computer Systems and Networks,

2.1 Complexity Classes

15-859(M): Randomized Algorithms Lecturer: Shuchi Chawla Topic: Complexity classes, Identity checking Date: September 15, 2004 Scribe: Andrew Gilpin 2.1 Complexity Classes In this lecture we will look

Chapter 13: Binary and Mixed-Integer Programming

Chapter 3: Binary and Mixed-Integer Programming The general branch and bound approach described in the previous chapter can be customized for special situations. This chapter addresses two special situations:

NP-complete? NP-hard? Some Foundations of Complexity. Prof. Sven Hartmann Clausthal University of Technology Department of Informatics

NP-complete? NP-hard? Some Foundations of Complexity Prof. Sven Hartmann Clausthal University of Technology Department of Informatics Tractability of Problems Some problems are undecidable: no computer

Constant Factor Approximation Algorithm for the Knapsack Median Problem

Constant Factor Approximation Algorithm for the Knapsack Median Problem Amit Kumar Abstract We give a constant factor approximation algorithm for the following generalization of the k-median problem. We

Bicolored Shortest Paths in Graphs with Applications to Network Overlay Design

Bicolored Shortest Paths in Graphs with Applications to Network Overlay Design Hongsik Choi and Hyeong-Ah Choi Department of Electrical Engineering and Computer Science George Washington University Washington,

Breaking The Code. Ryan Lowe. Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and

Breaking The Code Ryan Lowe Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and a minor in Applied Physics. As a sophomore, he took an independent study

3. Linear Programming and Polyhedral Combinatorics

Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the

Notes 11: List Decoding Folded Reed-Solomon Codes

Introduction to Coding Theory CMU: Spring 2010 Notes 11: List Decoding Folded Reed-Solomon Codes April 2010 Lecturer: Venkatesan Guruswami Scribe: Venkatesan Guruswami At the end of the previous notes,

GENERATING LOW-DEGREE 2-SPANNERS

SIAM J. COMPUT. c 1998 Society for Industrial and Applied Mathematics Vol. 27, No. 5, pp. 1438 1456, October 1998 013 GENERATING LOW-DEGREE 2-SPANNERS GUY KORTSARZ AND DAVID PELEG Abstract. A k-spanner

Improving Experiments by Optimal Blocking: Minimizing the Maximum Within-block Distance

Improving Experiments by Optimal Blocking: Minimizing the Maximum Within-block Distance Michael J. Higgins Jasjeet Sekhon April 12, 2014 EGAP XI A New Blocking Method A new blocking method with nice theoretical

SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov

Serdica Math. J. 30 (2004), 95 102 SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS Nickolay Khadzhiivanov, Nedyalko Nenov Communicated by V. Drensky Abstract. Let Γ(M) where M V (G) be the set of all vertices

Mechanisms for Fair Attribution Eric Balkanski Yaron Singer Abstract We propose a new framework for optimization under fairness constraints. The problems we consider model procurement where the goal is

Adaptive Linear Programming Decoding Mohammad H. Taghavi and Paul H. Siegel ECE Department, University of California, San Diego Email: (mtaghavi, psiegel)@ucsd.edu ISIT 2006, Seattle, USA, July 9 14, 2006

EE384Y Project Final Report Load Balancing and Switch Scheduling Xiangheng Liu Department of Electrical Engineering Stanford University, Stanford CA 94305 Email: liuxh@systems.stanford.edu Abstract Load

Discuss the size of the instance for the minimum spanning tree problem.

3.1 Algorithm complexity The algorithms A, B are given. The former has complexity O(n 2 ), the latter O(2 n ), where n is the size of the instance. Let n A 0 be the size of the largest instance that can

Ph.D. Thesis. Judit Nagy-György. Supervisor: Péter Hajnal Associate Professor

Online algorithms for combinatorial problems Ph.D. Thesis by Judit Nagy-György Supervisor: Péter Hajnal Associate Professor Doctoral School in Mathematics and Computer Science University of Szeged Bolyai

A Branch and Bound Algorithm for Solving the Binary Bi-level Linear Programming Problem

A Branch and Bound Algorithm for Solving the Binary Bi-level Linear Programming Problem John Karlof and Peter Hocking Mathematics and Statistics Department University of North Carolina Wilmington Wilmington,

Factoring & Primality

Factoring & Primality Lecturer: Dimitris Papadopoulos In this lecture we will discuss the problem of integer factorization and primality testing, two problems that have been the focus of a great amount

Competitive Analysis of On line Randomized Call Control in Cellular Networks

Competitive Analysis of On line Randomized Call Control in Cellular Networks Ioannis Caragiannis Christos Kaklamanis Evi Papaioannou Abstract In this paper we address an important communication issue arising

Universal hashing. In other words, the probability of a collision for two different keys x and y given a hash function randomly chosen from H is 1/m.

Universal hashing No matter how we choose our hash function, it is always possible to devise a set of keys that will hash to the same slot, making the hash scheme perform poorly. To circumvent this, we

Generating models of a matched formula with a polynomial delay

Generating models of a matched formula with a polynomial delay Petr Savicky Institute of Computer Science, Academy of Sciences of Czech Republic, Pod Vodárenskou Věží 2, 182 07 Praha 8, Czech Republic

CS787: Advanced Algorithms Topic: Online Learning Presenters: David He, Chris Hopman 17.3.1 Follow the Perturbed Leader 17.3.1.1 Prediction Problem Recall the prediction problem that we discussed in class.

Why? A central concept in Computer Science. Algorithms are ubiquitous.

Analysis of Algorithms: A Brief Introduction Why? A central concept in Computer Science. Algorithms are ubiquitous. Using the Internet (sending email, transferring files, use of search engines, online

Big Data - Lecture 1 Optimization reminders

Big Data - Lecture 1 Optimization reminders S. Gadat Toulouse, Octobre 2014 Big Data - Lecture 1 Optimization reminders S. Gadat Toulouse, Octobre 2014 Schedule Introduction Major issues Examples Mathematics

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory

Equilibrium computation: Part 1

Equilibrium computation: Part 1 Nicola Gatti 1 Troels Bjerre Sorensen 2 1 Politecnico di Milano, Italy 2 Duke University, USA Nicola Gatti and Troels Bjerre Sørensen ( Politecnico di Milano, Italy, Equilibrium

Globally Optimal Crowdsourcing Quality Management

Globally Optimal Crowdsourcing Quality Management Akash Das Sarma Stanford University akashds@stanford.edu Aditya G. Parameswaran University of Illinois (UIUC) adityagp@illinois.edu Jennifer Widom Stanford

Outline. NP-completeness. When is a problem easy? When is a problem hard? Today. Euler Circuits

Outline NP-completeness Examples of Easy vs. Hard problems Euler circuit vs. Hamiltonian circuit Shortest Path vs. Longest Path 2-pairs sum vs. general Subset Sum Reducing one problem to another Clique

9.2 Summation Notation

9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a

One last point: we started off this book by introducing another famously hard search problem:

S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani 261 Factoring One last point: we started off this book by introducing another famously hard search problem: FACTORING, the task of finding all prime factors

Disjunction of Non-Binary and Numeric Constraint Satisfaction Problems

Disjunction of Non-Binary and Numeric Constraint Satisfaction Problems Miguel A. Salido, Federico Barber Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia Camino

Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs

CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like

On the Unique Games Conjecture

On the Unique Games Conjecture Subhash Khot Courant Institute of Mathematical Sciences, NYU Abstract This article surveys recently discovered connections between the Unique Games Conjecture and computational

Permutation Betting Markets: Singleton Betting with Extra Information

Permutation Betting Markets: Singleton Betting with Extra Information Mohammad Ghodsi Sharif University of Technology ghodsi@sharif.edu Hamid Mahini Sharif University of Technology mahini@ce.sharif.edu

CHAPTER 11: BASIC LINEAR PROGRAMMING CONCEPTS

Linear programming is a mathematical technique for finding optimal solutions to problems that can be expressed using linear equations and inequalities. If a real-world problem can be represented accurately

Computational Learning Theory Spring Semester, 2009/10 Lecture 11: Sponsored search Lecturer: Yishay Mansour Scribe: Ben Pere, Jonathan Heimann, Alon Levin 11.1 Sponsored Search 11.1.1 Introduction Search

Lecture 13: Factoring Integers

CS 880: Quantum Information Processing 0/4/0 Lecture 3: Factoring Integers Instructor: Dieter van Melkebeek Scribe: Mark Wellons In this lecture, we review order finding and use this to develop a method

The Conference Call Search Problem in Wireless Networks

The Conference Call Search Problem in Wireless Networks Leah Epstein 1, and Asaf Levin 2 1 Department of Mathematics, University of Haifa, 31905 Haifa, Israel. lea@math.haifa.ac.il 2 Department of Statistics,

Routing in Line Planning for Public Transport

Konrad-Zuse-Zentrum für Informationstechnik Berlin Takustraße 7 D-14195 Berlin-Dahlem Germany MARC E. PFETSCH RALF BORNDÖRFER Routing in Line Planning for Public Transport Supported by the DFG Research

JUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS. Received December May 12, 2003; revised February 5, 2004

Scientiae Mathematicae Japonicae Online, Vol. 10, (2004), 431 437 431 JUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS Ondřej Čepeka and Shao Chin Sung b Received December May 12, 2003; revised February

Unraveling versus Unraveling: A Memo on Competitive Equilibriums and Trade in Insurance Markets

Unraveling versus Unraveling: A Memo on Competitive Equilibriums and Trade in Insurance Markets Nathaniel Hendren January, 2014 Abstract Both Akerlof (1970) and Rothschild and Stiglitz (1976) show that

Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs

Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs Yong Zhang 1.2, Francis Y.L. Chin 2, and Hing-Fung Ting 2 1 College of Mathematics and Computer Science, Hebei University,

Mean Ramsey-Turán numbers

Mean Ramsey-Turán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρ-mean coloring of a graph is a coloring of the edges such that the average

On an anti-ramsey type result

On an anti-ramsey type result Noga Alon, Hanno Lefmann and Vojtĕch Rödl Abstract We consider anti-ramsey type results. For a given coloring of the k-element subsets of an n-element set X, where two k-element

Theorem (informal statement): There are no extendible methods in David Chalmers s sense unless P = NP.

Theorem (informal statement): There are no extendible methods in David Chalmers s sense unless P = NP. Explication: In his paper, The Singularity: A philosophical analysis, David Chalmers defines an extendible

24. The Branch and Bound Method

24. The Branch and Bound Method It has serious practical consequences if it is known that a combinatorial problem is NP-complete. Then one can conclude according to the present state of science that no

The degree, size and chromatic index of a uniform hypergraph

The degree, size and chromatic index of a uniform hypergraph Noga Alon Jeong Han Kim Abstract Let H be a k-uniform hypergraph in which no two edges share more than t common vertices, and let D denote the

A Brief Introduction to Property Testing

A Brief Introduction to Property Testing Oded Goldreich Abstract. This short article provides a brief description of the main issues that underly the study of property testing. It is meant to serve as

Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay

Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture - 17 Shannon-Fano-Elias Coding and Introduction to Arithmetic Coding

Algorithm Design for Performance Aware VM Consolidation

Algorithm Design for Performance Aware VM Consolidation Alan Roytman University of California, Los Angeles Sriram Govindan Microsoft Corporation Jie Liu Microsoft Research Aman Kansal Microsoft Research

11 Ideals. 11.1 Revisiting Z

11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(

Completely Positive Cone and its Dual

On the Computational Complexity of Membership Problems for the Completely Positive Cone and its Dual Peter J.C. Dickinson Luuk Gijben July 3, 2012 Abstract Copositive programming has become a useful tool

Best Monotone Degree Bounds for Various Graph Parameters

Best Monotone Degree Bounds for Various Graph Parameters D. Bauer Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 S. L. Hakimi Department of Electrical and Computer

SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,

Some Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.

Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.com This paper contains a collection of 31 theorems, lemmas,

Page 1. CSCE 310J Data Structures & Algorithms. CSCE 310J Data Structures & Algorithms. P, NP, and NP-Complete. Polynomial-Time Algorithms

CSCE 310J Data Structures & Algorithms P, NP, and NP-Complete Dr. Steve Goddard goddard@cse.unl.edu CSCE 310J Data Structures & Algorithms Giving credit where credit is due:» Most of the lecture notes

Efficient Fault-Tolerant Infrastructure for Cloud Computing

Efficient Fault-Tolerant Infrastructure for Cloud Computing Xueyuan Su Candidate for Ph.D. in Computer Science, Yale University December 2013 Committee Michael J. Fischer (advisor) Dana Angluin James Aspnes

Scheduling Algorithm with Optimization of Employee Satisfaction

Washington University in St. Louis Scheduling Algorithm with Optimization of Employee Satisfaction by Philip I. Thomas Senior Design Project http : //students.cec.wustl.edu/ pit1/ Advised By Associate

THE SCHEDULING OF MAINTENANCE SERVICE

THE SCHEDULING OF MAINTENANCE SERVICE Shoshana Anily Celia A. Glass Refael Hassin Abstract We study a discrete problem of scheduling activities of several types under the constraint that at most a single

The Approximability of the Binary Paintshop Problem

The Approximability of the Binary Paintshop Problem Anupam Gupta 1, Satyen Kale 2, Viswanath Nagarajan 2, Rishi Saket 2, and Baruch Schieber 2 1 Dept. of Computer Science, Carnegie Mellon University, Pittsburgh

Adaptive Online Gradient Descent Peter L Bartlett Division of Computer Science Department of Statistics UC Berkeley Berkeley, CA 94709 bartlett@csberkeleyedu Elad Hazan IBM Almaden Research Center 650

Backdoors to Combinatorial Optimization: Feasibility and Optimality

Backdoors to Combinatorial Optimization: Feasibility and Optimality Bistra Dilkina, Carla P. Gomes, Yuri Malitsky 2, Ashish Sabharwal, and Meinolf Sellmann 2 Department of Computer Science, Cornell University,

Lecture 11: 0-1 Quadratic Program and Lower Bounds

Lecture : - Quadratic Program and Lower Bounds (3 units) Outline Problem formulations Reformulation: Linearization & continuous relaxation Branch & Bound Method framework Simple bounds, LP bound and semidefinite

Notes on Factoring. MA 206 Kurt Bryan

The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor

Semi-Matchings for Bipartite Graphs and Load Balancing

Semi-Matchings for Bipartite Graphs and Load Balancing Nicholas J. A. Harvey Richard E. Ladner László Lovász Tami Tamir Abstract We consider the problem of fairly matching the left-hand vertices of a bipartite

Introduction to Logic in Computer Science: Autumn 2006

Introduction to Logic in Computer Science: Autumn 2006 Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss 1 Plan for Today Now that we have a basic understanding

How Much Can Taxes Help Selfish Routing?

How Much Can Taxes Help Selfish Routing? Richard Cole Yevgeniy Dodis Tim Roughgarden July 28, 25 Abstract We study economic incentives for influencing selfish behavior in networks. We consider a model