Greedy Algorithm And Matroid Intersection Algorithm. Summer Term Talk Summary Paul Wilhelm

Save this PDF as:

Size: px
Start display at page:

Download "Greedy Algorithm And Matroid Intersection Algorithm. Summer Term Talk Summary Paul Wilhelm"

Transcription

1 Greedy Algorithm And Matroid Intersection Algorithm Summer Term 2010 Talk Summary Paul Wilhelm December 20, 2011

2 1 Greedy Algorithm Abstract Many combinatorial optimization problems can be formulated in terms of independence systems. In the first part I want to introduce the class of greedy algorithms, which find an optimal solution for all weight functions if and only if the independence system is a matroid. For some problems like finding the matching in a bipartite graph or the travelling salesman problem the system is not a matroid. But I prove that every independence system is the finite intersection of matroids. The problem of finding the matching in a bipartite graph, can be described as intersection of two matroids. For this case I present the Edmond s Intersection Algorithm which solve the problem in polynomial time. 1 Greedy Algorithm The maximization problem is defined as the task to find a set I such that the weight w() = e w(e) for w : E R is maximized. For the maximization problem, we can define the best-in-greedy algorithm for a given independence oracle: 1.1 Best-In-Greedy Algorithm Sort E = {e 1,..., e n } s.t. w(e 1 )... w(e n ). Set := I. For i:=1 to n do: If F {e i } I then set := {e i }. Output: I. The complexity of sorting E is O(n log(n)), but we have to ask the oracle in each step of the loop. Therefore the complexity of the algorithm mainly depends on the complexity of the independence oracle. 1.2 Feasibility In Matroids In general the greedy algorithm find only a local optimum and the cardinality of the output has not to be maximum, the output is just maximal (i.e. there exists no independent superset). But for matroids we can prove the following theorem if we assume that the greedy algorithm work correctly in the independence system: Theorem (Feasability). An independence system is a matroid if and only if the best-in-greedy algorithm for all weight functions finds an optimal solution for the maximization problem. 2

3 1.2 Feasibility In Matroids Proof : First we prove that in a matroid the best-in-greedy algorithm finds an optimal solution for all weight functions. Let w be an abitrary weight function and = {x 1,..., x r } the output of the greedy algorithm. Without loss of generality we may assume w(x 1 )... w(x r ) (if not we change the numbering). We show that has a maximum cardinality by contradiction, we then use that to prove by contradiction that w() is maximum 1 : Assume there exists a set Y I with greater cardinality than. By the augmentation property follows, that there exists a y Y \ such that {y} I. Therefore a t has to exist such that {x 1,..., x t, y, x t+1,..., x r } I with w(x t ) w(y) w(x t+1 ). Hence {x 1,..., x t } {x 1,..., x t, y} I. But then y should be choosen in step t + 1 of the greedy algorithm, what contradicts the correctness. Next we assume that there exists a Y = {y 1,..., y q } I such that w(y ) > w() and w(y i ) w(y i+1 ). By the definiton of the weight function follows that y i Y w(y i) > x i w(x i) and because Y there exists a k such that w(y k ) > w(x k ). Define := {x 1,..., x k 1 } (= if k = 1) and Y := {y 1,..., y k }. Because of the augmentation property there exists a y t Y \ with t k such that {x 1,..., x k 1, y t } = {y t } I. But then y t should be choosen before step k of the greedy algorithm, because w(y t ) w(y k ) > w(x k ). This contradicts the assumption that is the correct output of the greedy algorithm. Secondly we want to prove by contradiction that the feasibility of the greedy algorithm for all weight functions implies that the independence system is a matroid. We assume that the independence system is not a matroid, i.e. there exists sets I, J I with I < J such that for all e J \ I the set I {e} is dependent. Under this assumption the greedy algorithm would not work for the following weight function 2 with a variable ε > 0 which we specify later: 1 + ε, if e I w(e) := 1, if e J \ I 0, if e E \ {I J} For this weight function the greedy algorithm would first choose all elements of the set I, because they got the heighest weight. After this it can not choose any element of J, because of the assumption. Only elements of E \ {I J} could be choosen afterwards. Therefore the weight of the output of the greedy algorithm is 1 Due to (Oxley, 2006, pp ). 2 Due to (Lee, 2004, p. 60). w() = I (1 + ε)

4 2 Matroid Intersection But for the weight of J holds the inequality J\I w() = I (1 + ε) < w(j) = J \ I + I J (1 + ε) for ε < 1. This implies that the greedy algorithm would not have found I I J the optimal solution for that ε, and that is a contradiction to the correctness of the algorithm for all weight functions. 2 Matroid Intersection Proposition. Any independendence system is a finite intersection of matroids. Proof : For each circuit C C in (E, I) we define I C := {F E C \ F }. We will prove that every (E, I C ) is an independence system, even a matroid 3 and that the intersection of all I C is indeed I. Obviously is I C because C \ =. Also for I J with J I C is I I C because C \ J implies C \ I. The independence system (E, I C ) is a matroid because for all subsets of E the rank r is equal to the lower rank ϱ: If I C then has an unique maximal independent subset in I C namely itself. Hence r() = ϱ() := min{ Y : Y, Y I and Y {x} I x \ Y } = If I C then every maximal independent subset of is of the form \ {c} for any c C, because C \ ( \ {c}). Hence r() = ϱ() = 1 As the rank is equal to the lower rank for all subsets of E the rank quotient of (E, I C ) is one and therefore the independence system is a matroid. 4 Now we show that (E, I) = (E, C C I C ): Every F C C I C is independent. If not there would exist a circuit C C with C F such that C \ F =, what would contradict the assumption that F is out of the intersection. If F I then for all C C would be C \ F and therefore F would be an element in the intersection. To find a maximum cardinality set out of the intersection of two matroids (E, I 1 ) and (E, I 2 ) we can use Edmonds matroid intersection algorithm. The idea of the algorithm is to start with = I 1 I 2 and augment by one element in each step. When you find no more e E such that = {e} I 1 I 2, 3 Due to (Du, 2008, p. 24). 4 See Propositon (Korte and Vygen, 2007, p. 308). 4

5 2.1 Edmonds Matroid Intersection Algorithm then construct a special directed bipartite graph G over the disjoint vertice sets and E \. Search in this graph for a certain shortest alternating path P. With = V (P ) = \ V (P ) V (P ) \ augment by one element and repeat until you can not augment anymore. For i = 1, 2 let C i (, e) be the unique circuit in the matroid (E, I i ) which is a subset of {e}. For all I 1 I 2, we can define the directed auxiliary graph G by: A (1) A (2) := {(x, y) y E \, x C 1(, y) \ {y}} := {(y, x) y E \, x C 2(, y) \ {y}} G := ( E \, A (1) A(2) ). Then we are searching for the shortest path from S :={y E \ {y} I 1 } to T :={y E \ {y} I 2 } to augment. Fig from (Korte and Vygen, 2007, p. 324) If S T and therefore {e} I 1 I 2 for all e S T, we can augment by any element in S T. If S T = and the length of the shortest S T -path is greater then zero, we augment the set by using the symmetric difference of and the vertices of the path. If there exists no S T -path at all we are done and I 1 I 2 got its maximum size. This leads to the following algorithm with polynomial complexity on the maximum of the two independence oracles 5 : 2.1 Edmonds Matroid Intersection Algorithm Set :=. While we can augment do: Add all elements e such that = {e} I 1 I 2. For all y E \ compute C i (, y). Compute S, T, and G. Find shortest S T -path P in G. If no P exists stop, else set = V (P ) and repeat. Output:. To prove the correctness of this algorithm we need three lemma from (Korte and Vygen, 2007, pp ), the first two show that indeed V (P ) I 1 I 2 5 A short proof of the complexity you can find in (Korte and Vygen, 2007, Theorem p. 326), a more detailed proof you can find in (Papadimitriou and Steiglitz, 1982, pp ). 5

6 2 Matroid Intersection and the third shows that the algorithm finds the set of maximum cardinality in the intersection: 2.2 Correctness Of The Algorithm Lemma (13.27). Let (E, I) be a matroid and I. Let x 1,..., x s and y 1,..., y s with (a) x k C(, y k ) for k = 1,..., s and (b) x j C(, y k ) for 1 j < k s. Then is ( \ {x 1,..., x s }) {y 1,..., y s } I. Proof : Let be r := ( \ {x 1,..., x r }) {y 1,..., y r }, then we want to prove that r I for all r {1,..., s} by induction: For r = 0 we have nothing to prove because 0 = I. In the inductive step we are assuming that r 1 I and want to prove that r I by case destinction: If r 1 {y k } I it follows by I2 that ( r 1 \ {x r }) {y r } = r I. If r 1 {y k } I, we prove that r I by contradiction. If we assume that r 1 \ {x r } {y r } I, there has to exists a circuit C r 1 \ {x r } {y r }. Additionally there exists a circuit C(, y r ) {y r } for which even C(, y r ) \ {x 1,..., x r 1 } {y r } because of b). This circuits are distinct, because x r C by assumption and x r C(, y r ) by a). Hence y r C C(, y r ), otherwise C r 1 or C(, y r ) would be and therefore independent, what would contradict the fact that both are circuits. Now by C3 6 follows that there exists a circuit C 3 (C C(, y r )) \ {y r }, for which holds: C 3 ([ r 1 \ {x r } {y r }] [ \ {x 1,..., x r 1 } {y r }]) \ {y r } [ \ {x 1,..., x r } {y 1,..., y r 1 }] \ {x 1,.., x r 1 } \ {x 1,..., x r } {y 1,..., y r 1 } r 1 I This would imply that there exists an independent circuit, what is a contradiction and therefore is r I in contrary to the assumption. 6 See (Korte and Vygen, 2007, Theorem (C3) pp ). 6

7 2.2 Correctness Of The Algorithm Lemma (13.28). Let I 1 I 2. Let y 0, x 1, y 1,..., x s, y s be in this order the vertices of a shortest y 0 -y s -path in G, with y 0 S and y s T. Then is := ( {y 0,.., y s }) \ {x 1,..., x s } I 1 I 2. Proof : Because y 0,..., y s is a shortest y 0 -y s -path in G we know that 1. (x j, y j ) A (1) 2. (y j 1, x j ) A (2) := {(x, y) y E \, x C 1(, y) \ {y}} and := {(y, x) y E \, x C 2(, y) \ {y}} for all j 1,..., s. From this we can show that the requirements of lemma and the properties a) and b) are fulfilled in both matroids. First we want to show that I 1 : We define := {y 0 } which is independent because y 0 S. We know that x j because x j C 1 (, y j ) \ {y j } and we know y j E \ because y j y 0 for all j = 1,..., s and therefore the requirements of the lemma are fulfilled for. Property a) of the lemma is satisfied, because from 1. for all j {1,..., s} follows that x j C 1 (, y j ) C 1 (, y j ). Property b) is satisfied, because if for any k < s a j < k exists such that x j C 1 (, y k ) = C 1 (, y k ) 7 there would be a shortcut x j y k, what contradicts the fact that y 0 x 1 y 1...x j y j...x k y k...y s is the shortest x 0 -y s -path. Altogether lemma implies that \ {x 1,..., x s } {y 1,..., y s } = I 1. Analog we want to show that I 2 : We define := {y s } which is independent because y s T. We know that x j because x j C 2 (, y j 1 ) \ {y j 1 } and we know y j 1 E \ because y j 1 y 0 for all j = 1,..., s and therefore the requirements of the lemma are fulfilled for. Property a) of the lemma is satisfied, because from 1. for all j {1,..., s} follows that x j C 2 (, y j 1 ) C 2 (, y j 1 ). Property b) is satisfied, because if for any j < s a i < j exists such that x j C 2 (, y i 1 ) = C 2 (, y i 1 ) 8 there would be a shortcut y i 1 x j, what contradicts the fact that y 0 x 1...y i 1 x i...y j 1 x j...y s is the shortest x 0 -y s -path. Now lemma implies that \ {x 1,..., x s } {y 0,..., y s 1 } = I 2. 7 See (Korte and Vygen, 2007, Lemma b)): {y k } {y 0 } {y k } contains at most one circuit and therefore both cycles are equal. 8 See (Korte and Vygen, 2007, Lemma b)): {y i 1 } {y s } {y i 1 } contains at most one circuit and therefore both cycles are equal. 7

8 References Lemma (13.30). I 1 I 2 is maximum if and only if there is no S -T -path in G. Proof : We prove by contradiction that if I 1 I 2 is maximum there exists no S -T -path in G. If we assume there exists a S -T path, there also exists a shortest one. We apply lemma and obtain a set I 1 I 2 with < what contradicts the requirement that is maximum. Then we prove that the set is maximum, if there is no S -T -path. Let R be the set of vertices reachable from S in G. Hence R T =. Let r 1 and r 2 be the rank function of I 1 and I 2, respectively. Fig from (Korte and Vygen, 2007, p. 326) First we prove r 2 (R) = R by contradiction: If r 2 (R) > R, there would exist a y R \ such that ( R) {y} I 2. Because y R and R T = we know that y T = {y E \ {y} I 2 } and therefore a circuit C 2 (, y) I 2 exists. Because {y} I 2 and ( R) I 2, there has to exist a x \ R with x C 2 (, y), even x C 2 (, y) \ {y} because x y. But then (y, x) A (2) = {(y, x) y E \, x C 2(, y) \ {y}} means there exists an edge in G which leaves R because x \ R. This contradicts the definition of R. Now we prove r 1 (E \ R) = ( \ R) by contradiction: If r 1 (E \R) > \R, there would exist a y (E \R)\( \R) such that ( \R) {y} I 1. Because y R and S R we know y S = {y E \ {y} I 1 } and therefore a circuit C 1 (, y) I 1 exists. Because {y} I 1 and ( \ R) I 1, there has to exist a x R with x C 1 (, y), even x C 1 (, y) \ {y} because x y. But then (x, y) A (1) := {(x, y) y E \, x C 1(, y) \ {y}} means there exists an edge in G which leaves R because y R. This contradicts the definition of R. Altogether we have = \ R + R = r 2 (R) + r 1 (E \ R). We know that for all I 1 I 2 holds the inequality r 2 (R) + r 1 (E \ R) = 9. And therefore is maximum. References [Du 2008] Du, Ding-zhu: Design and Analysis of Computer Algorithms (Lecture 11, Lecture Notes 2008). (2008). URL ~dxd056000/cs6363/lect11.ppt 9 See (Korte and Vygen, 2007, Proposition 13.29). 8

9 References [Korte and Vygen 2007] Korte, Bernhard ; Vygen, Jens: Combinatorial Optimization: Theory and Algorithms. Fourth Edition. Springer Berlin Heidelberg, (Algorithms and Combinatorics). ISBN [Lee 2004] Lee, Jon: A First Course in Combinatorial Optimization. Cambridge University Press, ISBN [Oxley 2006] Oxley, James G.: Matroid Theory (Oxford Graduate Texts in Mathematics). Oxford University Press, USA, ISBN [Papadimitriou and Steiglitz 1982] Papadimitriou, Christos H. ; Steiglitz, Kenneth: Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, Inc, ISBN

2.3 Scheduling jobs on identical parallel machines

2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed

Resource Allocation with Time Intervals

Resource Allocation with Time Intervals Andreas Darmann Ulrich Pferschy Joachim Schauer Abstract We study a resource allocation problem where jobs have the following characteristics: Each job consumes

Welcome to the course Algorithm Design

HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Welcome to the course Algorithm Design Summer Term 2011 Friedhelm Meyer auf der Heide Lecture 6, 20.5.2011 Friedhelm Meyer auf

Lecture 3: Linear Programming Relaxations and Rounding

Lecture 3: Linear Programming Relaxations and Rounding 1 Approximation Algorithms and Linear Relaxations For the time being, suppose we have a minimization problem. Many times, the problem at hand can

MATHEMATICAL ENGINEERING TECHNICAL REPORTS. The Independent Even Factor Problem

MATHEMATICAL ENGINEERING TECHNICAL REPORTS The Independent Even Factor Problem Satoru IWATA and Kenjiro TAKAZAWA METR 2006 24 April 2006 DEPARTMENT OF MATHEMATICAL INFORMATICS GRADUATE SCHOOL OF INFORMATION

On the representability of the bi-uniform matroid

On the representability of the bi-uniform matroid Simeon Ball, Carles Padró, Zsuzsa Weiner and Chaoping Xing August 3, 2012 Abstract Every bi-uniform matroid is representable over all sufficiently large

Every tree contains a large induced subgraph with all degrees odd

Every tree contains a large induced subgraph with all degrees odd A.J. Radcliffe Carnegie Mellon University, Pittsburgh, PA A.D. Scott Department of Pure Mathematics and Mathematical Statistics University

Graphical degree sequences and realizations

swap Graphical and realizations Péter L. Erdös Alfréd Rényi Institute of Mathematics Hungarian Academy of Sciences MAPCON 12 MPIPKS - Dresden, May 15, 2012 swap Graphical and realizations Péter L. Erdös

Generalized Induced Factor Problems

Egerváry Research Group on Combinatorial Optimization Technical reports TR-2002-07. Published by the Egrerváry Research Group, Pázmány P. sétány 1/C, H 1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.

Scheduling to Minimize Power Consumption using Submodular Functions

Scheduling to Minimize Power Consumption using Submodular Functions Erik D. Demaine MIT edemaine@mit.edu Morteza Zadimoghaddam MIT morteza@mit.edu ABSTRACT We develop logarithmic approximation algorithms

Determination of the normalization level of database schemas through equivalence classes of attributes

Computer Science Journal of Moldova, vol.17, no.2(50), 2009 Determination of the normalization level of database schemas through equivalence classes of attributes Cotelea Vitalie Abstract In this paper,

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

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

Analysis of Algorithms, I

Analysis of Algorithms, I CSOR W4231.002 Eleni Drinea Computer Science Department Columbia University Thursday, February 26, 2015 Outline 1 Recap 2 Representing graphs 3 Breadth-first search (BFS) 4 Applications

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

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

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

ON THE COEFFICIENTS OF THE LINKING POLYNOMIAL

ADSS, Volume 3, Number 3, 2013, Pages 45-56 2013 Aditi International ON THE COEFFICIENTS OF THE LINKING POLYNOMIAL KOKO KALAMBAY KAYIBI Abstract Let i j T( M; = tijx y be the Tutte polynomial of the matroid

All trees contain a large induced subgraph having all degrees 1 (mod k)

All trees contain a large induced subgraph having all degrees 1 (mod k) David M. Berman, A.J. Radcliffe, A.D. Scott, Hong Wang, and Larry Wargo *Department of Mathematics University of New Orleans New

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

Cycles in a Graph Whose Lengths Differ by One or Two

Cycles in a Graph Whose Lengths Differ by One or Two J. A. Bondy 1 and A. Vince 2 1 LABORATOIRE DE MATHÉMATIQUES DISCRÉTES UNIVERSITÉ CLAUDE-BERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact

Fairness in Routing and Load Balancing

Fairness in Routing and Load Balancing Jon Kleinberg Yuval Rabani Éva Tardos Abstract We consider the issue of network routing subject to explicit fairness conditions. The optimization of fairness criteria

CS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010

CS 598CSC: Combinatorial Optimization Lecture date: /4/010 Instructor: Chandra Chekuri Scribe: David Morrison Gomory-Hu Trees (The work in this section closely follows [3]) Let G = (V, E) be an undirected

Oberwolfach Preprints

Oberwolfach Preprints OWP 2008-10 JON LEE, SHMUEL ONN AND ROBERT WEISMANTEL Nonlinear Optimization over a Weighted Independence System Mathematisches Forschungsinstitut Oberwolfach ggmbh Oberwolfach Preprints

Distributed Computing over Communication Networks: Maximal Independent Set

Distributed Computing over Communication Networks: Maximal Independent Set What is a MIS? MIS An independent set (IS) of an undirected graph is a subset U of nodes such that no two nodes in U are adjacent.

R u t c o r Research R e p o r t. Boolean functions with a simple certificate for CNF complexity. Ondřej Čepeka Petr Kučera b Petr Savický c

R u t c o r Research R e p o r t Boolean functions with a simple certificate for CNF complexity Ondřej Čepeka Petr Kučera b Petr Savický c RRR 2-2010, January 24, 2010 RUTCOR Rutgers Center for Operations

Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs

Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph

Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

! 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

Discrete Applied Mathematics. The firefighter problem with more than one firefighter on trees

Discrete Applied Mathematics 161 (2013) 899 908 Contents lists available at SciVerse ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam The firefighter problem with

On Integer Additive Set-Indexers of Graphs

On Integer Additive Set-Indexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A set-indexer of a graph G is an injective set-valued function f : V (G) 2 X such that

Cycle transversals in bounded degree graphs

Electronic Notes in Discrete Mathematics 35 (2009) 189 195 www.elsevier.com/locate/endm Cycle transversals in bounded degree graphs M. Groshaus a,2,3 P. Hell b,3 S. Klein c,1,3 L. T. Nogueira d,1,3 F.

Midterm Practice Problems

6.042/8.062J Mathematics for Computer Science October 2, 200 Tom Leighton, Marten van Dijk, and Brooke Cowan Midterm Practice Problems Problem. [0 points] In problem set you showed that the nand operator

1 Introduction. Dr. T. Srinivas Department of Mathematics Kakatiya University Warangal 506009, AP, INDIA tsrinivasku@gmail.com

A New Allgoriitthm for Miiniimum Costt Liinkiing M. Sreenivas Alluri Institute of Management Sciences Hanamkonda 506001, AP, INDIA allurimaster@gmail.com Dr. T. Srinivas Department of Mathematics Kakatiya

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

SOLUTIONS TO ASSIGNMENT 1 MATH 576

SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS BY OLIVIER MARTIN 13 #5. Let T be the topology generated by A on X. We want to show T = J B J where B is the set of all topologies J on X with A J. This amounts

Tree-representation of set families and applications to combinatorial decompositions

Tree-representation of set families and applications to combinatorial decompositions Binh-Minh Bui-Xuan a, Michel Habib b Michaël Rao c a Department of Informatics, University of Bergen, Norway. buixuan@ii.uib.no

Integer factorization is in P

Integer factorization is in P Yuly Shipilevsky Toronto, Ontario, Canada E-mail address: yulysh2000@yahoo.ca Abstract A polynomial-time algorithm for integer factorization, wherein integer factorization

each college c i C has a capacity q i - the maximum number of students it will admit

n colleges in a set C, m applicants in a set A, where m is much larger than n. each college c i C has a capacity q i - the maximum number of students it will admit each college c i has a strict order i

POWER SETS AND RELATIONS

POWER SETS AND RELATIONS L. MARIZZA A. BAILEY 1. The Power Set Now that we have defined sets as best we can, we can consider a sets of sets. If we were to assume nothing, except the existence of the empty

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

CS 103X: Discrete Structures Homework Assignment 3 Solutions

CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering

The Online Set Cover Problem

The Online Set Cover Problem Noga Alon Baruch Awerbuch Yossi Azar Niv Buchbinder Joseph Seffi Naor ABSTRACT Let X = {, 2,..., n} be a ground set of n elements, and let S be a family of subsets of X, S

Graph Theory Problems and Solutions

raph Theory Problems and Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November, 005 Problems. Prove that the sum of the degrees of the vertices of any finite graph is

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

Single machine parallel batch scheduling with unbounded capacity

Workshop on Combinatorics and Graph Theory 21th, April, 2006 Nankai University Single machine parallel batch scheduling with unbounded capacity Yuan Jinjiang Department of mathematics, Zhengzhou University

A Partition-Based Efficient Algorithm for Large Scale. Multiple-Strings Matching

A Partition-Based Efficient Algorithm for Large Scale Multiple-Strings Matching Ping Liu Jianlong Tan, Yanbing Liu Software Division, Institute of Computing Technology, Chinese Academy of Sciences, Beijing,

Uniform Multicommodity Flow through the Complete Graph with Random Edge-capacities

Combinatorics, Probability and Computing (2005) 00, 000 000. c 2005 Cambridge University Press DOI: 10.1017/S0000000000000000 Printed in the United Kingdom Uniform Multicommodity Flow through the Complete

On Data Recovery in Distributed Databases

On Data Recovery in Distributed Databases Sergei L. Bezrukov 1,UweLeck 1, and Victor P. Piotrowski 2 1 Dept. of Mathematics and Computer Science, University of Wisconsin-Superior {sbezruko,uleck}@uwsuper.edu

Local search for the minimum label spanning tree problem with bounded color classes

Available online at www.sciencedirect.com Operations Research Letters 31 (003) 195 01 Operations Research Letters www.elsevier.com/locate/dsw Local search for the minimum label spanning tree problem with

Clique coloring B 1 -EPG graphs

Clique coloring B 1 -EPG graphs Flavia Bonomo a,c, María Pía Mazzoleni b,c, and Maya Stein d a Departamento de Computación, FCEN-UBA, Buenos Aires, Argentina. b Departamento de Matemática, FCE-UNLP, La

! 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

Degree Hypergroupoids Associated with Hypergraphs

Filomat 8:1 (014), 119 19 DOI 10.98/FIL1401119F Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Degree Hypergroupoids Associated

Algorithm Design and Analysis

Algorithm Design and Analysis LECTURE 27 Approximation Algorithms Load Balancing Weighted Vertex Cover Reminder: Fill out SRTEs online Don t forget to click submit Sofya Raskhodnikova 12/6/2011 S. Raskhodnikova;

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

Foundations of Logic and Mathematics

Yves Nievergelt Foundations of Logic and Mathematics Applications to Computer Science and Cryptography Birkhäuser Boston Basel Berlin Contents Preface Outline xiii xv A Theory 1 0 Boolean Algebraic Logic

Graphs without proper subgraphs of minimum degree 3 and short cycles

Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract

8. Matchings and Factors

8. Matchings and Factors Consider the formation of an executive council by the parliament committee. Each committee needs to designate one of its members as an official representative to sit on the council,

Reminder: Complexity (1) Parallel Complexity Theory. Reminder: Complexity (2) Complexity-new

Reminder: Complexity (1) Parallel Complexity Theory Lecture 6 Number of steps or memory units required to compute some result In terms of input size Using a single processor O(1) says that regardless of

Reminder: Complexity (1) Parallel Complexity Theory. Reminder: Complexity (2) Complexity-new GAP (2) Graph Accessibility Problem (GAP) (1)

Reminder: Complexity (1) Parallel Complexity Theory Lecture 6 Number of steps or memory units required to compute some result In terms of input size Using a single processor O(1) says that regardless of

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

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

The Line Connectivity Problem

Konrad-Zuse-Zentrum für Informationstechnik Berlin Takustraße 7 D-14195 Berlin-Dahlem Germany RALF BORNDÖRFER MARIKA NEUMANN MARC E. PFETSCH The Line Connectivity Problem Supported by the DFG Research

Diversity Coloring for Distributed Data Storage in Networks 1

Diversity Coloring for Distributed Data Storage in Networks 1 Anxiao (Andrew) Jiang and Jehoshua Bruck California Institute of Technology Pasadena, CA 9115, U.S.A. {jax, bruck}@paradise.caltech.edu Abstract

Practical Guide to the Simplex Method of Linear Programming

Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear

most 4 Mirka Miller 1,2, Guillermo Pineda-Villavicencio 3, The University of Newcastle Callaghan, NSW 2308, Australia University of West Bohemia

Complete catalogue of graphs of maimum degree 3 and defect at most 4 Mirka Miller 1,2, Guillermo Pineda-Villavicencio 3, 1 School of Electrical Engineering and Computer Science The University of Newcastle

Even Faster Algorithm for Set Splitting!

Even Faster Algorithm for Set Splitting! Daniel Lokshtanov Saket Saurabh Abstract In the p-set Splitting problem we are given a universe U, a family F of subsets of U and a positive integer k and the objective

5.1 Bipartite Matching

CS787: Advanced Algorithms Lecture 5: Applications of Network Flow In the last lecture, we looked at the problem of finding the maximum flow in a graph, and how it can be efficiently solved using the Ford-Fulkerson

A class of on-line scheduling algorithms to minimize total completion time

A class of on-line scheduling algorithms to minimize total completion time X. Lu R.A. Sitters L. Stougie Abstract We consider the problem of scheduling jobs on-line on a single machine and on identical

8.1 Makespan Scheduling

600.469 / 600.669 Approximation Algorithms Lecturer: Michael Dinitz Topic: Dynamic Programing: Min-Makespan and Bin Packing Date: 2/19/15 Scribe: Gabriel Kaptchuk 8.1 Makespan Scheduling Consider an instance

Definition 11.1. Given a graph G on n vertices, we define the following quantities:

Lecture 11 The Lovász ϑ Function 11.1 Perfect graphs We begin with some background on perfect graphs. graphs. First, we define some quantities on Definition 11.1. Given a graph G on n vertices, we define

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

Pricing of Limit Orders in the Electronic Security Trading System Xetra

Pricing of Limit Orders in the Electronic Security Trading System Xetra Li Xihao Bielefeld Graduate School of Economics and Management Bielefeld University, P.O. Box 100 131 D-33501 Bielefeld, Germany

Classification of Cartan matrices

Chapter 7 Classification of Cartan matrices In this chapter we describe a classification of generalised Cartan matrices This classification can be compared as the rough classification of varieties in terms

ON DEGREES IN THE HASSE DIAGRAM OF THE STRONG BRUHAT ORDER

Séminaire Lotharingien de Combinatoire 53 (2006), Article B53g ON DEGREES IN THE HASSE DIAGRAM OF THE STRONG BRUHAT ORDER RON M. ADIN AND YUVAL ROICHMAN Abstract. For a permutation π in the symmetric group

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

SPANNING CACTI FOR STRUCTURALLY CONTROLLABLE NETWORKS NGO THI TU ANH NATIONAL UNIVERSITY OF SINGAPORE

SPANNING CACTI FOR STRUCTURALLY CONTROLLABLE NETWORKS NGO THI TU ANH NATIONAL UNIVERSITY OF SINGAPORE 2012 SPANNING CACTI FOR STRUCTURALLY CONTROLLABLE NETWORKS NGO THI TU ANH (M.Sc., SFU, Russia) A THESIS

On end degrees and infinite cycles in locally finite graphs

On end degrees and infinite cycles in locally finite graphs Henning Bruhn Maya Stein Abstract We introduce a natural extension of the vertex degree to ends. For the cycle space C(G) as proposed by Diestel

SHORT CYCLE COVERS OF GRAPHS WITH MINIMUM DEGREE THREE

SHOT YLE OVES OF PHS WITH MINIMUM DEEE THEE TOMÁŠ KISE, DNIEL KÁL, END LIDIKÝ, PVEL NEJEDLÝ OET ŠÁML, ND bstract. The Shortest ycle over onjecture of lon and Tarsi asserts that the edges of every bridgeless

Topic: Greedy Approximations: Set Cover and Min Makespan Date: 1/30/06

CS880: Approximations Algorithms Scribe: Matt Elder Lecturer: Shuchi Chawla Topic: Greedy Approximations: Set Cover and Min Makespan Date: 1/30/06 3.1 Set Cover The Set Cover problem is: Given a set of

Applied Algorithm Design Lecture 5

Applied Algorithm Design Lecture 5 Pietro Michiardi Eurecom Pietro Michiardi (Eurecom) Applied Algorithm Design Lecture 5 1 / 86 Approximation Algorithms Pietro Michiardi (Eurecom) Applied Algorithm Design

Introduction to Algorithms Review information for Prelim 1 CS 4820, Spring 2010 Distributed Wednesday, February 24

Introduction to Algorithms Review information for Prelim 1 CS 4820, Spring 2010 Distributed Wednesday, February 24 The final exam will cover seven topics. 1. greedy algorithms 2. divide-and-conquer algorithms

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora Scribe: One of the running themes in this course is the notion of

Introduction to Graph Theory

Introduction to Graph Theory Allen Dickson October 2006 1 The Königsberg Bridge Problem The city of Königsberg was located on the Pregel river in Prussia. The river divided the city into four separate

Optimal Index Codes for a Class of Multicast Networks with Receiver Side Information

Optimal Index Codes for a Class of Multicast Networks with Receiver Side Information Lawrence Ong School of Electrical Engineering and Computer Science, The University of Newcastle, Australia Email: lawrence.ong@cantab.net

Cycles and clique-minors in expanders

Cycles and clique-minors in expanders Benny Sudakov UCLA and Princeton University Expanders Definition: The vertex boundary of a subset X of a graph G: X = { all vertices in G\X with at least one neighbor

AN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC

AN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC W. T. TUTTE. Introduction. In a recent series of papers [l-4] on graphs and matroids I used definitions equivalent to the following.

Problem Set I: Preferences, W.A.R.P., consumer choice

Problem Set I: Preferences, W.A.R.P., consumer choice Paolo Crosetto paolo.crosetto@unimi.it Exercises solved in class on 18th January 2009 Recap:,, Definition 1. The strict preference relation is x y

A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries

Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do

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,

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

Collinear Points in Permutations

Collinear Points in Permutations Joshua N. Cooper Courant Institute of Mathematics New York University, New York, NY József Solymosi Department of Mathematics University of British Columbia, Vancouver,

On the independence number of graphs with maximum degree 3

On the independence number of graphs with maximum degree 3 Iyad A. Kanj Fenghui Zhang Abstract Let G be an undirected graph with maximum degree at most 3 such that G does not contain any of the three graphs

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

CONTRIBUTIONS TO ZERO SUM PROBLEMS

CONTRIBUTIONS TO ZERO SUM PROBLEMS S. D. ADHIKARI, Y. G. CHEN, J. B. FRIEDLANDER, S. V. KONYAGIN AND F. PAPPALARDI Abstract. A prototype of zero sum theorems, the well known theorem of Erdős, Ginzburg

Research Article Stability Analysis for Higher-Order Adjacent Derivative in Parametrized Vector Optimization

Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 2010, Article ID 510838, 15 pages doi:10.1155/2010/510838 Research Article Stability Analysis for Higher-Order Adjacent Derivative

ZERO-DIVISOR GRAPHS OF POLYNOMIALS AND POWER SERIES OVER COMMUTATIVE RINGS

ZERO-DIVISOR GRAPHS OF POLYNOMIALS AND POWER SERIES OVER COMMUTATIVE RINGS M. AXTELL, J. COYKENDALL, AND J. STICKLES Abstract. We recall several results of zero divisor graphs of commutative rings. We