Randomized rounding of semidefinite programs and primal-dual method for integer linear programming. Reza Moosavi Dr. Saeedeh Parsaeefard Dec.
|
|
- Pamela Stevenson
- 5 years ago
- Views:
Transcription
1 Randomized rounding of semidefinite programs and primal-dual method for integer linear programming Dr. Saeedeh Parsaeefard
2 Semidefinite Programming ()
3 1
4 Integer Programming integer programming problem Integer variables NP-hard Linear Non linear 4
5 Integer Programming Heuristic Approach Metaheuristic Approach Simulated Annealing Genetic algorithms Tabu search No guarantee for optimality of solution Low complexity Approximation algorithms Guarantee a maximum distance from optimal solution Low complexity Strong math base 5
6 Approximation Algorithms α approximation algorithm Minimization problem Solution α. OPT for α > 1 Maximization problem Solution α. OPT for α < 1 6
7 Approximation Algorithms Rounding data and dynamic programming Deterministic rounding of linear programming Random sampling and randomized rounding of linear programs Randomized rounding of semidefinite programming Simple, Good bound The primal-dual method Combinatorial problem, Online algorithms, prove of bound 7
8 2 Semidefinite Programming
9 Semidefinite Programming Semidefinite programming uses symmetric, positive semidefinite matrices Definition A matrix X ज n n is positive semidefinite if and only if for all y R n, y T Xy 0. X ज n n is symmetric, then the following statements are equivalent: 1. X is positive semidefinite; 2. X has non-negative eigenvalues; 3. X = V T V for some V ज m n where m n; 4. X = i=1 λ i ω i ω T i for some λ i 1&ω i ω T j 0 for i j. 0 and vectors w i R n such that ω i ω T i = 9
10 Semidefinite Programming Maximize (Minimize) i,j c ij x ij Subject to: i,j a ijk x ij = b k, k, x ij = x ji, i, j, X = x ij 0. 10
11 Semidefinite Programming Vector programming If x ij = v i T v j = v i v j, then X = V T V. Maximize (Minimize) i,j c ij (v i. v j ) Subject to: i,j a ijk (v i. v j ) = b k, k, v i R n, i = 1,, n. 11
12 MAX CUT G = (V, E) w ij 0 for each edge (i, j) Partition vertex set into two parts, U and W = V U Maximize the weight of edges whose two endpoints are in different parts U = {i: y i = 1}, W = {i: y i = 1} Maximize 1/2 (i,j) E w ij (1 y i. y j ) Subject to: y i { 1, 1} i = 1,, n, 12
13 MAX CUT OPT is the value of the optimal solution of maximum cut problem Vector programming Optimal value Z VP If v i = y i, 0,0,, 0, then v i. v i = 1 & v i. v j = y i y j. Z VP OPT Maximize 1/2 (i,j) E w ij (1 v i. v j ) Subject to: v i. v i = 1, i = 1,, n, v i R n, i = 1,, n. 13
14 MAX CUT The Algorithm 1. Pick a random vector r = (r 1,, r n ), each component with distribution N(0,1) 2. Set unit vector v i =(0,,0,1,0,,0), 3. Put i U if v i. r 0 and i W otherwise. 14
15 MAX CUT Another way of looking at the algorithm 1. All vectors v i lie on the unit sphere, since v i. v i = 1 and they are unit vectors. 2. The hyperplane with normal r containing the origin splits the sphere in half 3. vertices in one half (the half such that v i. r 0 ) are put into U, and all vertices in the other half are put into W 15
16 MAX CUT Theorem Rounding the vector programming by choosing a random hyperplane is a α =0.878-approximation algorithm for the maximum cut problem. M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42: ,
17 Quadratic Programming We restrict the objective matrix A 0, because objective is not negative Optimal value OPT Maximize 1 i,j n a ij x i x j Subject to: x i 1, +1, i = 1,, n, A = a ij 0 17
18 Quadratic Programming Vector programming Optimal value Z VP Maximize 1 i,j n a ij ( v i. v j ) Subject to: v i. v i = 1, i = 1,, n, v i R n, i = 1,, n. 18
19 Quadratic Programming The Algorithm 1. choose a random hyperplane with normal r. 2. Set x i = 1 if v i. r 0 and x i = 1 otherwise. Theorem This approach gives an α = 2 -approximation algorithm for the quadratic π programming problem Nesterov, Y., Semidefinite relaxation and nonconvex quadratic optimization. Optimization methods and software, (1-3): p
20 Correlation Clustering Undirected graph G = (V, E) Each edge i, j E has two nonnegative weight w ij + 0 and w ij 0. Goal is to cluster the vertices into several sets to maximize total w ij + of the nodes in similar cluster plus w ij of nodes in different clusters 20
21 Correlation Clustering Partition S is clustering of vertices δ(s) is set of edges with endpoints in different sets E(S) is set of edges with both endpoints in same set Find S to maximize i,j E(S) w ij + + i,j δ(s) w ij Let e k be kth unit vector, where its kth element is equal to one and zero elsewhere. x i = e i if i is in kth cluster Maximize (i,j) E (w ij + x i. x j + w ij (1 x i. x j )) Subject to: x i e 1, e 2,, e n i. 21
22 Correlation Clustering Vector programming Optimal value Z CC OPT Maximize (i,j) E (w ij + v i. v j + w ij (1 v.i. v j )) Subject to: v i. v i = 1, i. v i. v j 0, i, j v i R n, i. 22
23 Correlation Clustering The Algorithm 1. we choose two random hyperplane, with two independent vectors r 1 and r This approach partitions the vertices into 4 sets. R 1 = {i V: r 1. v i 0, r 2. v i 0} R 2 = {i V: r 1. v i 0, r 2. v i < 0} R 3 = {i V: r 1. v i < 0, r 2. v i 0} R 4 = {i V: r 1. v i < 0, r 2. v i < 0} 23
24 Correlation Clustering Theorem The approach gets a α = 3 -approximation algorithm 4 Swamy, C. Correlation clustering: maximizing agreements via semidefinite programming. in Proceedings of the fifteenth annual ACM- SIAM symposium on Discrete algorithms Society for Industrial and Applied Mathematics. 24
25 Paper Example 1 multiple multicast sessions Several overloaded link N alternative path 25
26 Paper Example 1 Semidefinite programming Prove 2-approximation min x M m 1 n 1 N s. t. x 1 m M n 1 M m 1 N mn mn mn m mn pn mn r x B x C n N x 0,1 S. Q. Zhang, Q. Zhang, H. Bannazadeh, and A. Leon-Garcia, Routing algorithms for network function virtualization enabled multicast topology on SDN, IEEE Transactions on Network and Service Management, vol. 12, pp , Dec
27 Paper Example 1 27
28 Paper Example 1 28
29 Paper Example 2 For correlative clustering If small cells i, j in a cluster x i,j = 1, x i,j = 0 otherwise No frequency reuse (decrease sum rate) Channel gain (Interference) F: set of femtocells M: maximum cluster size 29
30 Paper Example 2 max w x w (1 x ) x i, j i F j F s. t. x 1, i F i, i i, j j, k i, k i, j i, j i, j i, j i, j n i, j x x x 1, i, j, k F, k>i, j i,k j F x M, i F x 0, i, j F X=(x ) 0. Obtain a solution with performance Branch and Bound A. Abdelnasser, E. Hossain and D. I. Kim, Clustering and resource allocation for dense femtocells in a two-tier cellular OFDMA network, IEEE Trans. Wireless Commun., vol. 13, no. 3, pp , Mar
31 Paper Example 2 31
32 Paper Example 2 32
33 3
34 dual method Integer Programming Relax variable Find dual problem Find feasible solution of integer programming based dual problem 34
35 dual method Instead of actually solving the dual LP, we can construct a feasible dual solution with the same properties. According to dual problem, obtain primal solution Obtain a bound for solution dual method is also used in combinatorial optimization and online algorithms 35
36 dual method linear programming 36
37 Set Cover Problem Input a ground set of elements E = e 1,..., e n. Some subsets of those elements S 1, S 2,..., S m E. Nonnegative weight w j for each subset S j. The goal is to find a minimum-weight collection of subsets that covers all of E j=1 m Minimize w j. x j Subject to: j:ei S j x j 1, i = 1,, n, x j {0,1}, j = 1,, m. 37
38 Set Cover Problem Relax integer programming to linear programming Obtain dual problem i=1 n Maximize y i Subject to: i:ei S j y i w j, j = 1,, m, y j 0, i = 1,, n. 38
39 Set Cover Problem The Algorithm R. Bar-Yehuda and S. Even. A linear time approximation algorithm for the weighted vertex cover problem. Journal of Algorithms, 2: ,
40 Set Cover Problem Theorem The above algorithm is an f-approximation algorithm for the set cover problem. f = max {j: e i S j } i R. Bar-Yehuda and S. Even. A linear time approximation algorithm for the weighted vertex cover problem. Journal of Algorithms, 2: ,
41 The feedback vertex set Undirected graph G = (V, E) Weights w i for vertices i V The goal is to choose a minimum-cost subset of vertices S V such that every cycle C in the graph contains some vertex of S. Find a minimum-cost set of vertices S such that the induced graph G[V S] is acyclic. Minimize i V w i. x i Subject to: i C x i 1, C C, x i {0,1}, i V. 41
42 The feedback vertex set Relax integer programming to linear programming Obtain dual problem Maximize C C y C Subject to: C C:i C y C w i, i V, y C 0, C C. 42
43 The feedback vertex set The Algorithm R. Bar-Yehuda, D. Geiger, J. Naor, and R. M. Roth. Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference. SIAM Journal on Computing, 27: ,
44 The feedback vertex set Theorem the Algorithm is an (4 log 2 n )-approximation algorithm for the feedback vertex set problem. R. Bar-Yehuda, D. Geiger, J. Naor, and R. M. Roth. Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference. SIAM Journal on Computing, 27: ,
45 Shortest Path Undirected graph G = (V, E) Costs c e for edges e E Find minimum-cost path from s to d S set of all s t cuts δ S set of all edges that one endpoint in S and the other endpoint not in S. Minimize e E c e. x e Subject to: e δ(s) x e 1, S S, x e {0,1}, e E. 45
46 Shortest Path Relax integer programming to linear programming Obtain dual problem Maximize S S y S Subject to: S S:e δ(s) y S c e, e E, y S 0, S S. 46
47 Shortest Path The Algorithm *F δ C = A. Hoffman. On simple combinatorial optimization problems. Discrete Mathematics, 106/107: ,
48 Shortest Path Theorem The Algorithm finds a shortest path from s to t. A. Hoffman. On simple combinatorial optimization problems. Discrete Mathematics, 106/107: ,
49 4
50 Randomized rounding of semidefinite programs for integer programming primal-dual method for integer programming Guarantee a maximum distance from optimal solution Low complexity Strong math base Apply to some problem 50
51 References [1] Williamson, D.P. and D.B. Shmoys, The design of approximation algorithms. 2011: Cambridge university press. [2] Strang, G., et al., to linear algebra. Vol : Wellesley-Cambridge Press Wellesley, MA. [3] Wolkowicz, H., R. Saigal, and L.Vandenberghe, Handbook of semidefinite programming: theory, algorithms, and applications. Vol : Springer Science & Business Media. [4] Goemans, M.X. and D.P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM (JACM), (6): p [5] Fernandez De La Vega, W., MAX CUT has a randomized approximation scheme in dense graphs. Random Structures & Algorithms, (3): p [6] Fotakis, D., A primal-dual algorithm for online non-uniform facility location. Journal of Discrete Algorithms, (1): p [7] Nesterov, Y., Semidefinite relaxation and nonconvex quadratic optimization. Optimization methods and software, (1-3): p [8] Swamy, C. Correlation clustering: maximizing agreements via semidefinite programming. in Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms Society for Industrial and Applied Mathematics. [9] Williamson, D.P., On the design of approximation algorithms for a class of graph problems. 1993, Massachusetts Institute of Technology. [10] Karger, D., R. Motwani, and M. Sudan. Approximate graph coloring by semidefinite programming. in Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on IEEE. [11] Zhang, S.Q., et al., Routing algorithms for network function virtualization enabled multicast topology on SDN. IEEE transactions on Network and Service Management, (4): p
52 References [12] Abdelnasser, A., E. Hossain, and D.I. Kim, Clustering and resource allocation for dense femtocells in a two-tier cellular OFDMA network. IEEE Transactions on Wireless Communications, (3): p [13] R. Bar-Yehuda and S. Even. A linear time approximation algorithm for the weighted vertex cover problem. Journal of Algorithms, 2: , [14] R. Bar-Yehuda, D. Geiger, J. Naor, and R. M. Roth. Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference. SIAM Journal on Computing, 27: , [15] A. Hoffman. On simple combinatorial optimization problems. Discrete Mathematics, 106/107: ,
53 Thank You For Your Attention
Lecture 9. Semidefinite programming is linear programming where variables are entries in a positive semidefinite matrix.
CSE525: Randomized Algorithms and Probabilistic Analysis Lecture 9 Lecturer: Anna Karlin Scribe: Sonya Alexandrova and Keith Jia 1 Introduction to semidefinite programming Semidefinite programming is linear
More information6 Randomized rounding of semidefinite programs
6 Randomized rounding of semidefinite programs We now turn to a new tool which gives substantially improved performance guarantees for some problems We now show how nonlinear programming relaxations can
More informationCSC Linear Programming and Combinatorial Optimization Lecture 12: Semidefinite Programming(SDP) Relaxation
CSC411 - Linear Programming and Combinatorial Optimization Lecture 1: Semidefinite Programming(SDP) Relaxation Notes taken by Xinwei Gui May 1, 007 Summary: This lecture introduces the semidefinite programming(sdp)
More informationThe Online Connected Facility Location Problem
The Online Connected Facility Location Problem Mário César San Felice 1, David P. Willamson 2, and Orlando Lee 1 1 Unicamp, Institute of Computing, Campinas SP 13083-852, Brazil felice@ic.unicamp.br, lee@ic.unicamp.br
More informationPrimal-Dual Methods for Approximation Algorithms
Primal-Dual Methods for Approximation Algorithms Nadia Hardy, April 2004 The following is based on: Approximation Algorithms for NP-Hard Problems. D.Hochbaum, ed. Chapter 4: The primal-dual method for
More informationWeek 5. Convex Optimization
Week 5. Convex Optimization Lecturer: Prof. Santosh Vempala Scribe: Xin Wang, Zihao Li Feb. 9 and, 206 Week 5. Convex Optimization. The convex optimization formulation A general optimization problem is
More informationTopic: Local Search: Max-Cut, Facility Location Date: 2/13/2007
CS880: Approximations Algorithms Scribe: Chi Man Liu Lecturer: Shuchi Chawla Topic: Local Search: Max-Cut, Facility Location Date: 2/3/2007 In previous lectures we saw how dynamic programming could be
More informationResearch Interests Optimization:
Mitchell: Research interests 1 Research Interests Optimization: looking for the best solution from among a number of candidates. Prototypical optimization problem: min f(x) subject to g(x) 0 x X IR n Here,
More informationLocal Search Approximation Algorithms for the Complement of the Min-k-Cut Problems
Local Search Approximation Algorithms for the Complement of the Min-k-Cut Problems Wenxing Zhu, Chuanyin Guo Center for Discrete Mathematics and Theoretical Computer Science, Fuzhou University, Fuzhou
More informationThe Design of Approximation Algorithms
The Design of Approximation Algorithms David P. Williamson Cornell University David B. Shmoys Cornell University m Щ0 CAMBRIDGE UNIVERSITY PRESS Contents Preface page ix I An Introduction to the Techniques
More informationApproximation Algorithms
Approximation Algorithms Prof. Tapio Elomaa tapio.elomaa@tut.fi Course Basics A new 4 credit unit course Part of Theoretical Computer Science courses at the Department of Mathematics There will be 4 hours
More informationRounding procedures in Semidefinite Programming
Rounding procedures in Semidefinite Programming Philippe Meurdesoif Université Bordeaux 1 & INRIA-Bordeaux CIMINLP, March 19, 2009. 1 Presentation 2 Roundings for MaxCut problems 3 Randomized roundings
More informationA Survey of Correlation Clustering
COMS E6998: Advanced Topics in Computational Learning Theory. Author: Hila Becker Date: May 5, 2005 A Survey of Correlation Clustering Abstract The problem of partitioning a set of data points into clusters
More informationA 4-Approximation Algorithm for k-prize Collecting Steiner Tree Problems
arxiv:1802.06564v1 [cs.cc] 19 Feb 2018 A 4-Approximation Algorithm for k-prize Collecting Steiner Tree Problems Yusa Matsuda and Satoshi Takahashi The University of Electro-Communications, Japan February
More informationAn Efficient Approximation for the Generalized Assignment Problem
An Efficient Approximation for the Generalized Assignment Problem Reuven Cohen Liran Katzir Danny Raz Department of Computer Science Technion Haifa 32000, Israel Abstract We present a simple family of
More informationGroup Secret Key Generation Algorithms
Group Secret Key Generation Algorithms Chunxuan Ye and Alex Reznik InterDigital Communications Corporation King of Prussia, PA 9406 Email: {Chunxuan.Ye, Alex.Reznik}@interdigital.com arxiv:cs/07024v [cs.it]
More informationLEAST COST ROUTING ALGORITHM WITH THE STATE SPACE RELAXATION IN A CENTRALIZED NETWORK
VOL., NO., JUNE 08 ISSN 896608 00608 Asian Research Publishing Network (ARPN). All rights reserved. LEAST COST ROUTING ALGORITHM WITH THE STATE SPACE RELAXATION IN A CENTRALIZED NETWORK Y. J. Lee Department
More informationXLVI Pesquisa Operacional na Gestão da Segurança Pública
Setembro de 014 Approximation algorithms for simple maxcut of split graphs Rubens Sucupira 1 Luerbio Faria 1 Sulamita Klein 1- IME/UERJ UERJ, Rio de JaneiroRJ, Brasil rasucupira@oi.com.br, luerbio@cos.ufrj.br
More informationarxiv: v2 [cs.dm] 3 Dec 2014
The Student/Project Allocation problem with group projects Aswhin Arulselvan, Ágnes Cseh, and Jannik Matuschke arxiv:4.035v [cs.dm] 3 Dec 04 Department of Management Science, University of Strathclyde,
More informationIntroduction to Approximation Algorithms
Introduction to Approximation Algorithms Dr. Gautam K. Das Departmet of Mathematics Indian Institute of Technology Guwahati, India gkd@iitg.ernet.in February 19, 2016 Outline of the lecture Background
More informationAn FPTAS for minimizing the product of two non-negative linear cost functions
Math. Program., Ser. A DOI 10.1007/s10107-009-0287-4 SHORT COMMUNICATION An FPTAS for minimizing the product of two non-negative linear cost functions Vineet Goyal Latife Genc-Kaya R. Ravi Received: 2
More informationGraphs and Network Flows IE411. Lecture 21. Dr. Ted Ralphs
Graphs and Network Flows IE411 Lecture 21 Dr. Ted Ralphs IE411 Lecture 21 1 Combinatorial Optimization and Network Flows In general, most combinatorial optimization and integer programming problems are
More informationApproximation Algorithms
Approximation Algorithms Prof. Tapio Elomaa tapio.elomaa@tut.fi Course Basics A 4 credit unit course Part of Theoretical Computer Science courses at the Laboratory of Mathematics There will be 4 hours
More informationof Two 2-Approximation Algorithms for the Feedback Vertex Set Problem in Undirected Graphs Michel X. Goemans y M.I.T. David P. Williamson x IBM Watson
A Primal-Dual Interpretation of Two 2-Approximation Algorithms for the Feedback Vertex Set Problem in Undirected Graphs Fabian A. Chudak Cornell University Michel. Goemans y M.I.T. David P. Williamson
More informationLower-Bounded Facility Location
Lower-Bounded Facility Location Zoya Svitkina Abstract We study the lower-bounded facility location problem, which generalizes the classical uncapacitated facility location problem in that it comes with
More informationApproximation Algorithms
Approximation Algorithms Group Members: 1. Geng Xue (A0095628R) 2. Cai Jingli (A0095623B) 3. Xing Zhe (A0095644W) 4. Zhu Xiaolu (A0109657W) 5. Wang Zixiao (A0095670X) 6. Jiao Qing (A0095637R) 7. Zhang
More informationCS 473: Algorithms. Ruta Mehta. Spring University of Illinois, Urbana-Champaign. Ruta (UIUC) CS473 1 Spring / 36
CS 473: Algorithms Ruta Mehta University of Illinois, Urbana-Champaign Spring 2018 Ruta (UIUC) CS473 1 Spring 2018 1 / 36 CS 473: Algorithms, Spring 2018 LP Duality Lecture 20 April 3, 2018 Some of the
More informationColoring 3-colorable Graphs
Coloring 3-colorable Graphs Pawan Kumar Aurora Advised by Prof. Shashank K Mehta Department of Computer Science and Engineering Indian Institute of Technology, Kanpur State of the Art Seminar k-coloring
More informationComputational Complexity CSC Professor: Tom Altman. Capacitated Problem
Computational Complexity CSC 5802 Professor: Tom Altman Capacitated Problem Agenda: Definition Example Solution Techniques Implementation Capacitated VRP (CPRV) CVRP is a Vehicle Routing Problem (VRP)
More informationA 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH A FORCING GRAPH. Yotaro Takazawa Shinji Mizuno Tokyo Institute of Technology
Journal of the Operations Research Society of Japan Vol. 60, No. 1, January 2017, pp. 15 23 c The Operations Research Society of Japan A 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH
More informationIntroduction to Mathematical Programming IE406. Lecture 20. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 20 Dr. Ted Ralphs IE406 Lecture 20 1 Reading for This Lecture Bertsimas Sections 10.1, 11.4 IE406 Lecture 20 2 Integer Linear Programming An integer
More informationCombinatorial Algorithms for Minimizing the Weighted Sum of Completion Times on a Single Machine
Combinatorial Algorithms for Minimizing the Weighted Sum of Completion Times on a Single Machine James M. Davis 1 Department of Operations Research, Cornell University, Ithaca, NY 14850. Rajiv Gandhi Department
More informationPLANAR GRAPH BIPARTIZATION IN LINEAR TIME
PLANAR GRAPH BIPARTIZATION IN LINEAR TIME SAMUEL FIORINI, NADIA HARDY, BRUCE REED, AND ADRIAN VETTA Abstract. For each constant k, we present a linear time algorithm that, given a planar graph G, either
More informationA LOWER BOUND FOR THE QAP BASED ON GRAPH THEORY AND LINEAR PROGRAMMING
A LOWER BOUND FOR THE QAP BASED ON GRAPH THEORY AND LINEAR PROGRAMMING André R. S. Amaral Universidade Federal do Espírito Santo, Departamento de Informática, 29060-900, Vitória, ES, Brasil Abstract Let
More informationAlgorithms for Euclidean TSP
This week, paper [2] by Arora. See the slides for figures. See also http://www.cs.princeton.edu/~arora/pubs/arorageo.ps Algorithms for Introduction This lecture is about the polynomial time approximation
More informationIntroduction to Mathematical Programming IE496. Final Review. Dr. Ted Ralphs
Introduction to Mathematical Programming IE496 Final Review Dr. Ted Ralphs IE496 Final Review 1 Course Wrap-up: Chapter 2 In the introduction, we discussed the general framework of mathematical modeling
More informationAn Introduction to Dual Ascent Heuristics
An Introduction to Dual Ascent Heuristics Introduction A substantial proportion of Combinatorial Optimisation Problems (COPs) are essentially pure or mixed integer linear programming. COPs are in general
More informationOn the Maximum Quadratic Assignment Problem
MATHEMATICS OF OPERATIONS RESEARCH Vol. 34, No. 4, November 009, pp. 859 868 issn 0364-765X eissn 156-5471 09 3404 0859 informs doi 10.187/moor.1090.0418 009 INFORMS On the Maximum Quadratic Assignment
More informationApproximation Algorithms
Approximation Algorithms Frédéric Giroire FG Simplex 1/11 Motivation Goal: Find good solutions for difficult problems (NP-hard). Be able to quantify the goodness of the given solution. Presentation of
More informationGraph Theory and Optimization Approximation Algorithms
Graph Theory and Optimization Approximation Algorithms Nicolas Nisse Université Côte d Azur, Inria, CNRS, I3S, France October 2018 Thank you to F. Giroire for some of the slides N. Nisse Graph Theory and
More informationACO Comprehensive Exam October 12 and 13, Computability, Complexity and Algorithms
1. Computability, Complexity and Algorithms Given a simple directed graph G = (V, E), a cycle cover is a set of vertex-disjoint directed cycles that cover all vertices of the graph. 1. Show that there
More informationDETERMINISTIC OPERATIONS RESEARCH
DETERMINISTIC OPERATIONS RESEARCH Models and Methods in Optimization Linear DAVID J. RADER, JR. Rose-Hulman Institute of Technology Department of Mathematics Terre Haute, IN WILEY A JOHN WILEY & SONS,
More informationApproximation Basics
Milestones, Concepts, and Examples Xiaofeng Gao Department of Computer Science and Engineering Shanghai Jiao Tong University, P.R.China Spring 2015 Spring, 2015 Xiaofeng Gao 1/53 Outline History NP Optimization
More informationA primal dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
Operations Research Letters 22 (1998) 111 118 A primal dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs Fabian A. Chudak a;1, Michel X. Goemans
More informationMachine Learning for Software Engineering
Machine Learning for Software Engineering Introduction and Motivation Prof. Dr.-Ing. Norbert Siegmund Intelligent Software Systems 1 2 Organizational Stuff Lectures: Tuesday 11:00 12:30 in room SR015 Cover
More informationAlgorithmic complexity of two defence budget problems
21st International Congress on Modelling and Simulation, Gold Coast, Australia, 29 Nov to 4 Dec 2015 www.mssanz.org.au/modsim2015 Algorithmic complexity of two defence budget problems R. Taylor a a Defence
More informationLinear and Integer Programming :Algorithms in the Real World. Related Optimization Problems. How important is optimization?
Linear and Integer Programming 15-853:Algorithms in the Real World Linear and Integer Programming I Introduction Geometric Interpretation Simplex Method Linear or Integer programming maximize z = c T x
More informationComputing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes
Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes Miguel F. Anjos Department of Management Sciences, University of Waterloo, Waterloo,
More informationApproximating Node-Weighted Multicast Trees in Wireless Ad-Hoc Networks
Approximating Node-Weighted Multicast Trees in Wireless Ad-Hoc Networks Thomas Erlebach Department of Computer Science University of Leicester, UK te17@mcs.le.ac.uk Ambreen Shahnaz Department of Computer
More informationCourse Introduction / Review of Fundamentals of Graph Theory
Course Introduction / Review of Fundamentals of Graph Theory Hiroki Sayama sayama@binghamton.edu Rise of Network Science (From Barabasi 2010) 2 Network models Many discrete parts involved Classic mean-field
More informationPrimal-Dual Algorithms for Connected Facility Location Problems
Primal-Dual Algorithms for Connected Facility Location Problems Lecture Notes for the course Approximation algorithms by Martin Korff (korff@diku.dk) Matias Sevel Rasmussen (sevel@math.ku.dk) Tor Justesen
More informationApproximation algorithms for finding a -connected subgraph of a graph with minimum weight
Approximation algorithms for finding a -connected subgraph of a graph with minimum weight Tamás Hajba Submitted to HEJ. Manuscript no.: ANM-001130-A This version is for internal use only! Abstract It is
More informationApplied Lagrange Duality for Constrained Optimization
Applied Lagrange Duality for Constrained Optimization Robert M. Freund February 10, 2004 c 2004 Massachusetts Institute of Technology. 1 1 Overview The Practical Importance of Duality Review of Convexity
More informationREGULAR GRAPHS OF GIVEN GIRTH. Contents
REGULAR GRAPHS OF GIVEN GIRTH BROOKE ULLERY Contents 1. Introduction This paper gives an introduction to the area of graph theory dealing with properties of regular graphs of given girth. A large portion
More informationSolution for Homework set 3
TTIC 300 and CMSC 37000 Algorithms Winter 07 Solution for Homework set 3 Question (0 points) We are given a directed graph G = (V, E), with two special vertices s and t, and non-negative integral capacities
More informationClustering. SC4/SM4 Data Mining and Machine Learning, Hilary Term 2017 Dino Sejdinovic
Clustering SC4/SM4 Data Mining and Machine Learning, Hilary Term 2017 Dino Sejdinovic Clustering is one of the fundamental and ubiquitous tasks in exploratory data analysis a first intuition about the
More informationApproximation Algorithms: The Primal-Dual Method. My T. Thai
Approximation Algorithms: The Primal-Dual Method My T. Thai 1 Overview of the Primal-Dual Method Consider the following primal program, called P: min st n c j x j j=1 n a ij x j b i j=1 x j 0 Then the
More information1 Unweighted Set Cover
Comp 60: Advanced Algorithms Tufts University, Spring 018 Prof. Lenore Cowen Scribe: Yuelin Liu Lecture 7: Approximation Algorithms: Set Cover and Max Cut 1 Unweighted Set Cover 1.1 Formulations There
More informationImproved Gomory Cuts for Primal Cutting Plane Algorithms
Improved Gomory Cuts for Primal Cutting Plane Algorithms S. Dey J-P. Richard Industrial Engineering Purdue University INFORMS, 2005 Outline 1 Motivation The Basic Idea Set up the Lifting Problem How to
More informationIterative Methods in Combinatorial Optimization. R. Ravi Carnegie Bosch Professor Tepper School of Business Carnegie Mellon University
Iterative Methods in Combinatorial Optimization R. Ravi Carnegie Bosch Professor Tepper School of Business Carnegie Mellon University ravi@cmu.edu Combinatorial Optimization Easy Problems : polynomial
More informationStudying Graph Connectivity
Studying Graph Connectivity Freeman Yufei Huang July 1, 2002 Submitted for CISC-871 Instructor: Dr. Robin Dawes Studying Graph Connectivity Freeman Yufei Huang Submitted July 1, 2002 for CISC-871 In some
More informationCoverings and Matchings in r-partite Hypergraphs
Coverings and Matchings in r-partite Hypergraphs Douglas S. Altner Department of Mathematics, United States Naval Academy, Annapolis, Maryland, altner@usna.edu. J. Paul Brooks Department of Statistical
More informationLast topic: Summary; Heuristics and Approximation Algorithms Topics we studied so far:
Last topic: Summary; Heuristics and Approximation Algorithms Topics we studied so far: I Strength of formulations; improving formulations by adding valid inequalities I Relaxations and dual problems; obtaining
More informationA Note on Polyhedral Relaxations for the Maximum Cut Problem
A Note on Polyhedral Relaxations for the Maximum Cut Problem Alantha Newman Abstract We consider three well-studied polyhedral relaxations for the maximum cut problem: the metric polytope of the complete
More informationLecture 7: Asymmetric K-Center
Advanced Approximation Algorithms (CMU 18-854B, Spring 008) Lecture 7: Asymmetric K-Center February 5, 007 Lecturer: Anupam Gupta Scribe: Jeremiah Blocki In this lecture, we will consider the K-center
More informationGraph drawing in spectral layout
Graph drawing in spectral layout Maureen Gallagher Colleen Tygh John Urschel Ludmil Zikatanov Beginning: July 8, 203; Today is: October 2, 203 Introduction Our research focuses on the use of spectral graph
More informationLEXICOGRAPHIC LOCAL SEARCH AND THE P-CENTER PROBLEM
LEXICOGRAPHIC LOCAL SEARCH AND THE P-CENTER PROBLEM Refael Hassin, Asaf Levin and Dana Morad Abstract We introduce a local search strategy that suits combinatorial optimization problems with a min-max
More informationApproximating the Maximum Quadratic Assignment Problem 1
Approximating the Maximum Quadratic Assignment Problem 1 Esther M. Arkin Refael Hassin 3 Maxim Sviridenko 4 Keywords: Approximation algorithm; quadratic assignment problem 1 Introduction In the maximum
More informationNotes for Lecture 20
U.C. Berkeley CS170: Intro to CS Theory Handout N20 Professor Luca Trevisan November 13, 2001 Notes for Lecture 20 1 Duality As it turns out, the max-flow min-cut theorem is a special case of a more general
More informationLinear programming and the efficiency of the simplex algorithm for transportation polytopes
Linear programming and the efficiency of the simplex algorithm for transportation polytopes Edward D. Kim University of Wisconsin-La Crosse February 20, 2015 Loras College Department of Mathematics Colloquium
More informationMathematical Tools for Engineering and Management
Mathematical Tools for Engineering and Management Lecture 8 8 Dec 0 Overview Models, Data and Algorithms Linear Optimization Mathematical Background: Polyhedra, Simplex-Algorithm Sensitivity Analysis;
More informationarxiv:cs/ v1 [cs.cc] 28 Apr 2003
ICM 2002 Vol. III 1 3 arxiv:cs/0304039v1 [cs.cc] 28 Apr 2003 Approximation Thresholds for Combinatorial Optimization Problems Uriel Feige Abstract An NP-hard combinatorial optimization problem Π is said
More informationApproximating Fault-Tolerant Steiner Subgraphs in Heterogeneous Wireless Networks
Approximating Fault-Tolerant Steiner Subgraphs in Heterogeneous Wireless Networks Ambreen Shahnaz and Thomas Erlebach Department of Computer Science University of Leicester University Road, Leicester LE1
More informationAn O(log 2 k)-approximation Algorithm for the k-vertex Connected Spanning Subgraph Problem
An O(log 2 k)-approximation Algorithm for the k-vertex Connected Spanning Subgraph Problem ABSTRACT Jittat Fakcharoenphol Department of Computer Engineering Kasetsart University Bangkok, 0900, Thailand
More informationTwo models of the capacitated vehicle routing problem
Croatian Operational Research Review 463 CRORR 8(2017), 463 469 Two models of the capacitated vehicle routing problem Zuzana Borčinová 1, 1 Faculty of Management Science and Informatics, University of
More informationLecture 16: Gaps for Max-Cut
Advanced Approximation Algorithms (CMU 8-854B, Spring 008) Lecture 6: Gaps for Max-Cut Mar 6, 008 Lecturer: Ryan O Donnell Scribe: Ravishankar Krishnaswamy Outline In this lecture, we will discuss algorithmic
More informationScribe from 2014/2015: Jessica Su, Hieu Pham Date: October 6, 2016 Editor: Jimmy Wu
CS 267 Lecture 3 Shortest paths, graph diameter Scribe from 2014/2015: Jessica Su, Hieu Pham Date: October 6, 2016 Editor: Jimmy Wu Today we will talk about algorithms for finding shortest paths in a graph.
More informationAn Edge-Swap Heuristic for Finding Dense Spanning Trees
Theory and Applications of Graphs Volume 3 Issue 1 Article 1 2016 An Edge-Swap Heuristic for Finding Dense Spanning Trees Mustafa Ozen Bogazici University, mustafa.ozen@boun.edu.tr Hua Wang Georgia Southern
More informationA Simple, Greedy Approximation Algorithm for MAX SAT
A Simple, Greedy Approximation Algorithm for MAX SAT David P. Williamson Joint work with Matthias Poloczek (Frankfurt, Cornell) and Anke van Zuylen (William & Mary) Greedy algorithms Greedy Greed, for
More informationAn SDP Approach to Multi-level Crossing Minimization
An SDP Approach to Multi-level Crossing Minimization P. Hungerländer joint work with M. Chimani, M. Jünger, P. Mutzel University of Klagenfurt - Department of Mathematics 15th Combinatorial Optimization
More informationTowards more efficient infection and fire fighting
Towards more efficient infection and fire fighting Peter Floderus Andrzej Lingas Mia Persson The Centre for Mathematical Sciences, Lund University, 00 Lund, Sweden. Email: pflo@maths.lth.se Department
More informationOnline algorithms for clustering problems
University of Szeged Department of Computer Algorithms and Artificial Intelligence Online algorithms for clustering problems Summary of the Ph.D. thesis by Gabriella Divéki Supervisor Dr. Csanád Imreh
More informationarxiv: v1 [math.gr] 19 Dec 2018
GROWTH SERIES OF CAT(0) CUBICAL COMPLEXES arxiv:1812.07755v1 [math.gr] 19 Dec 2018 BORIS OKUN AND RICHARD SCOTT Abstract. Let X be a CAT(0) cubical complex. The growth series of X at x is G x (t) = y V
More informationPractice Final Exam 2: Solutions
lgorithm Design Techniques Practice Final Exam 2: Solutions 1. The Simplex lgorithm. (a) Take the LP max x 1 + 2x 2 s.t. 2x 1 + x 2 3 x 1 x 2 2 x 1, x 2 0 and write it in dictionary form. Pivot: add x
More informationGraph Vertex Colorability & the Hardness. Mengfei Cao COMP-150 Graph Theory Tufts University
Dec. 15 th, Presentation for Final Project Graph Vertex Colorability & the Hardness Mengfei Cao COMP-150 Graph Theory Tufts University Framework In General: Graph-2-colorability is in N Graph-3-colorability
More informationAn exact algorithm for max-cut in sparse graphs
An exact algorithm for max-cut in sparse graphs F. Della Croce a M. J. Kaminski b, V. Th. Paschos c a D.A.I., Politecnico di Torino, Italy b RUTCOR, Rutgers University c LAMSADE, CNRS UMR 7024 and Université
More information1 Introduction and Results
On the Structure of Graphs with Large Minimum Bisection Cristina G. Fernandes 1,, Tina Janne Schmidt,, and Anusch Taraz, 1 Instituto de Matemática e Estatística, Universidade de São Paulo, Brazil, cris@ime.usp.br
More informationExtensions of Semidefinite Coordinate Direction Algorithm. for Detecting Necessary Constraints to Unbounded Regions
Extensions of Semidefinite Coordinate Direction Algorithm for Detecting Necessary Constraints to Unbounded Regions Susan Perrone Department of Mathematics and Statistics Northern Arizona University, Flagstaff,
More informationHardness of Subgraph and Supergraph Problems in c-tournaments
Hardness of Subgraph and Supergraph Problems in c-tournaments Kanthi K Sarpatwar 1 and N.S. Narayanaswamy 1 Department of Computer Science and Engineering, IIT madras, Chennai 600036, India kanthik@gmail.com,swamy@cse.iitm.ac.in
More informationNon-convex Multi-objective Optimization
Non-convex Multi-objective Optimization Multi-objective Optimization Real-world optimization problems usually involve more than one criteria multi-objective optimization. Such a kind of optimization problems
More informationLec13p1, ORF363/COS323
Lec13 Page 1 Lec13p1, ORF363/COS323 This lecture: Semidefinite programming (SDP) Definition and basic properties Review of positive semidefinite matrices SDP duality SDP relaxations for nonconvex optimization
More informationLinear Programming. Course review MS-E2140. v. 1.1
Linear Programming MS-E2140 Course review v. 1.1 Course structure Modeling techniques Linear programming theory and the Simplex method Duality theory Dual Simplex algorithm and sensitivity analysis Integer
More informationToward the joint design of electronic and optical layer protection
Toward the joint design of electronic and optical layer protection Massachusetts Institute of Technology Slide 1 Slide 2 CHALLENGES: - SEAMLESS CONNECTIVITY - MULTI-MEDIA (FIBER,SATCOM,WIRELESS) - HETEROGENEOUS
More informationCollege of Computer & Information Science Fall 2007 Northeastern University 14 September 2007
College of Computer & Information Science Fall 2007 Northeastern University 14 September 2007 CS G399: Algorithmic Power Tools I Scribe: Eric Robinson Lecture Outline: Linear Programming: Vertex Definitions
More informationChordal Graphs: Theory and Algorithms
Chordal Graphs: Theory and Algorithms 1 Chordal graphs Chordal graph : Every cycle of four or more vertices has a chord in it, i.e. there is an edge between two non consecutive vertices of the cycle. Also
More informationON WEIGHTED RECTANGLE PACKING WITH LARGE RESOURCES*
ON WEIGHTED RECTANGLE PACKING WITH LARGE RESOURCES* Aleksei V. Fishkin, 1 Olga Gerber, 1 Klaus Jansen 1 1 University of Kiel Olshausenstr. 40, 24118 Kiel, Germany {avf,oge,kj}@informatik.uni-kiel.de Abstract
More informationarxiv: v1 [cs.dm] 21 Dec 2015
The Maximum Cardinality Cut Problem is Polynomial in Proper Interval Graphs Arman Boyacı 1, Tinaz Ekim 1, and Mordechai Shalom 1 Department of Industrial Engineering, Boğaziçi University, Istanbul, Turkey
More informationCMPSCI 311: Introduction to Algorithms Practice Final Exam
CMPSCI 311: Introduction to Algorithms Practice Final Exam Name: ID: Instructions: Answer the questions directly on the exam pages. Show all your work for each question. Providing more detail including
More informationIntroduction to Mathematical Programming IE406. Lecture 16. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 16 Dr. Ted Ralphs IE406 Lecture 16 1 Reading for This Lecture Bertsimas 7.1-7.3 IE406 Lecture 16 2 Network Flow Problems Networks are used to model
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpenCourseWare http://ocw.mit.edu 6.854J / 18.415J Advanced Algorithms Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advanced
More information