# Construction of Minimum-Weight Spanners Mikkel Sigurd Martin Zachariasen

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Construction of Minimum-Weight Spanners Mikkel Sigurd Martin Zachariasen University of Copenhagen

2 Outline Motivation and Background Minimum-Weight Spanner Problem Greedy Spanner Algorithm Exact Algorithm: Column Generation Approach Exact Algorithm: Constrained Shortest Paths Implementation Details Experimental Results Conclusions and Future Work

3 Motivation and Background Construction of sparse networks that (approximately) preserve distances in original (dense) networks. Application examples:

4 Motivation and Background Construction of sparse networks that (approximately) preserve distances in original (dense) networks. Application examples: Metric space searching. Compact data structure for holding information about approximate distances.

5 Motivation and Background Construction of sparse networks that (approximately) preserve distances in original (dense) networks. Application examples: Metric space searching. Compact data structure for holding information about approximate distances. Message distribution in networks. Construction of a network that has both low cost and low delay.

6 Motivation and Background Construction of sparse networks that (approximately) preserve distances in original (dense) networks. Application examples: Metric space searching. Compact data structure for holding information about approximate distances. Message distribution in networks. Construction of a network that has both low cost and low delay. Faster approximation algorithms for geometric problems. Replacing dense graphs by sparse graphs may speed up approximation algorithms for several geometric optimization problems (e.g., TSP).

7 -spanner problem (MWSP): Construct a Minimum-Weight Spanner Problem (MWSP) Given an undirected and edge-weighted graph. -spanner: Subgraph between any pair of nodes is at most (where is a fixed constant). of such that the shortest path times longer in than in Minimum-weight with minimum total edge-weight. -spanner in

8 Minimum-Weight Spanner Example Complete Euclidean graph with 15 nodes

9 -spanner for Minimum-Weight Spanner Example Minimum weight

10 -spanner for Minimum-Weight Spanner Example Minimum weight

11 -spanner for Minimum-Weight Spanner Example Minimum weight

12 -spanner for Minimum-Weight Spanner Example Minimum weight

13 -spanner for Minimum-Weight Spanner Example Minimum weight

14 -spanner for Minimum-Weight Spanner Example Minimum spanning tree (or minimum weight )

15 Minimum-Weight Spanner Problem (MWSP) Known to be an NP-hard problem [Cai, 1994].

16 Minimum-Weight Spanner Problem (MWSP) Known to be an NP-hard problem [Cai, 1994]. Several approximation algorithms exist, in particular for the geometric versions of the problem; the greedy algorithm is particularly well studied. All practical applications use some variant of the greedy algorithm.

17 Minimum-Weight Spanner Problem (MWSP) Known to be an NP-hard problem [Cai, 1994]. Several approximation algorithms exist, in particular for the geometric versions of the problem; the greedy algorithm is particularly well studied. All practical applications use some variant of the greedy algorithm. No (non-trivial) exact algorithm is known.

18 Greedy Spanner Algorithm 1. Set where. 2. Sort edges in by non-decreasing weight. 3. Process edges in sorted order: Let be the weight of edge. If the shortest path between and in exceeds, then append to.

19 Greedy Spanner Algorithm 1. Set where. 2. Sort edges in by non-decreasing weight. 3. Process edges in sorted order: Let be the weight of edge. If the shortest path between and in exceeds, then append to. Resulting -spanner denoted greedy spanner; known to have weight times that of a MST for points in fixed dimensional space. [Das, Narasimhan & Salowe, 1995; Das & Narasimhan, 1997]

20 New Exact Algorithm for MWSP Model a generalization of MWSP as an integer program.

21 New Exact Algorithm for MWSP Model a generalization of MWSP as an integer program. : Node pairs with length constraints. : Set of paths between and satisfying length constraint. : Set of all paths satisfying length constraint. if edge is on path. if edge is part of the solution. if path is part of the solution.

22 Integer Programming (IP) Formulation minimize (1.1) subject to (1.2) (1.3) (1.4) (1.5)

23 Properties of the IP Model Proposed model contains an exponential number of variables (no useful polynomial sized model is known). Model provides a good LP-relaxation lower bound. LP-relaxation can be solved by delayed column generation. Integer solutions obtained by embedding lower bound computations in branch and bound.

24 IP Column Generation Work on a restricted linear program with fewer variables. Add variables iteratively according to Dantzig s pricing rule: Add variable with minimum reduced cost. Given dual variables and, solve the pricing problem The pricing problem is a constrained shortest path problem between and on the graph with edge costs and weights.

25 Constrained Shortest Path Problem (CSPP) Find a shortest path from to with respect to the cost of edges such that the total weight is below a given threshold. NP-hard problem, but has a FPTAS [Warburton, 1987].

26 to Constrained Shortest Path Problem (CSPP) Find a shortest path from to with respect to the cost of edges such that the total weight is below a given threshold. NP-hard problem, but has a FPTAS [Warburton, 1987]. We solve CSPP by a labeling algorithm: Enumerate all paths from infeasible paths. discarding dominated and Domination and infeasibility can be checked quickly by precomputing shortest path trees from w.r.t. edge costs and weights, respectively.

27 Implementation Details Used ABACUS branch and price framework [Thienel, 1995]. LP models solved by CPLEX 7.0. Computer: Pentium IV 3.0 GHz, 2GB memory Master LP contains constraints. We solve master problem with fewer constraints, generating violated constraints iteratively. Branching on binary edge variables. Each instance allowed 30 minutes of CPU time.

28 Two Types of Test Instances

29 Two Types of Test Instances Euclidean: Complete Euclidean graphs on vertices randomly drawn from a -dimensional hypercube. / /

30 Two Types of Test Instances Euclidean: Complete Euclidean graphs on vertices randomly drawn from a -dimensional hypercube. / / Realistic: Similar to networks appearing in communication network applications: nodes randomly distributed in a square, edges added according to/not according to locality, and edge costs random or Euclidean. Average degree fixed. / /

31 Two Types of Test Instances Euclidean: Complete Euclidean graphs on vertices randomly drawn from a -dimensional hypercube. / / Realistic: Similar to networks appearing in communication network applications: nodes randomly distributed in a square, edges added according to/not according to locality, and edge costs random or Euclidean. Average degree fixed. / / 50 instances for every class/size of graphs.

32 Realistic Graph Examples,, no locality of edges

33 Realistic Graph Examples,, no locality of edges

34 Realistic Graph Examples,, with locality of edges

35 Realistic Graph Examples,, with locality of edges

36 Computational Results: Euclidean Graphs # Nodes Dimension # Nodes Dimension Average excess from optimum of greedy spanner (in percent).

37 Computational Results: Realistic Graphs Edge cost Euclidean Random Avg. deg # Nodes locality locality locality locality locality locality Average excess from optimum of greedy spanner (in percent).

38 Generalizations handled by Exact Algorithm MWSP with variable stretch factor. Allow different stretch factors for every pair of nodes. Easily handled by changing the definition of the feasible set of paths for a pair of nodes and. MWSP with selected shortest path constraints. Only a subset of all pairs have maximum length constraints. As an example, only paths involving one particular node (the root) have maximum length constraints. Has applications in, e.g., VLSI design, where trees with both low cost and low delay are wanted.

39 Conclusions and Future Work Total weight of a greedy spanner is within a few percent from optimum for the set of realistic instances; for Euclidean graphs and large stretch factors the quality of the greedy spanner deteriorates significantly. It would be interesting to test the exact algorithm and the greedy spanner algorithm on a larger set of problem instances. Also, improvements to the greedy spanner algorithm would be worthwhile to investigate.

### Construction of Minimum-Weight Spanners

Construction of Minimum-Weight Spanners Mikkel Sigurd and Martin Zachariasen Department of Computer Science, University of Copenhagen DK-2100 Copenhagen Ø, Denmark {sigurd,martinz}@diku.dk. Abstract. Spanners

### GENERAL ASSIGNMENT PROBLEM via Branch and Price JOHN AND LEI

GENERAL ASSIGNMENT PROBLEM via Branch and Price JOHN AND LEI Outline Review the column generation in Generalized Assignment Problem (GAP) GAP Examples in Branch and Price 2 Assignment Problem The assignment

### 3 INTEGER LINEAR PROGRAMMING

3 INTEGER LINEAR PROGRAMMING PROBLEM DEFINITION Integer linear programming problem (ILP) of the decision variables x 1,..,x n : (ILP) subject to minimize c x j j n j= 1 a ij x j x j 0 x j integer n j=

### Last 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

### Introduction 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

### Approximation 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

### Steiner Trees and Forests

Massachusetts Institute of Technology Lecturer: Adriana Lopez 18.434: Seminar in Theoretical Computer Science March 7, 2006 Steiner Trees and Forests 1 Steiner Tree Problem Given an undirected graph G

### Algorithm Design and Analysis

Algorithm Design and Analysis LECTURE 29 Approximation Algorithms Load Balancing Weighted Vertex Cover Reminder: Fill out SRTEs online Don t forget to click submit Sofya Raskhodnikova 12/7/2016 Approximation

### Minimum Weight Constrained Forest Problems. Problem Definition

Slide 1 s Xiaoyun Ji, John E. Mitchell Department of Mathematical Sciences Rensselaer Polytechnic Institute Troy, NY, USA jix@rpi.edu, mitchj@rpi.edu 2005 Optimization Days Montreal, Canada May 09, 2005

### Minimum Spanning Trees COSC 594: Graph Algorithms Spring By Kevin Chiang and Parker Tooley

Minimum Spanning Trees COSC 594: Graph Algorithms Spring 2017 By Kevin Chiang and Parker Tooley Test Questions 1. What is one NP-Hard problem for which Minimum Spanning Trees is a good approximation for?

### α Coverage to Extend Network Lifetime on Wireless Sensor Networks

Noname manuscript No. (will be inserted by the editor) α Coverage to Extend Network Lifetime on Wireless Sensor Networks Monica Gentili Andrea Raiconi Received: date / Accepted: date Abstract An important

### Solving the Maximum Cardinality Bin Packing Problem with a Weight Annealing-Based Algorithm

Solving the Maximum Cardinality Bin Packing Problem with a Weight Annealing-Based Algorithm Kok-Hua Loh Nanyang Technological University Bruce Golden University of Maryland Edward Wasil American University

### Lagrangian Relaxation in CP

Lagrangian Relaxation in CP Willem-Jan van Hoeve CPAIOR 016 Master Class Overview 1. Motivation for using Lagrangian Relaxations in CP. Lagrangian-based domain filtering Example: Traveling Salesman Problem.

### Solving the Euclidean Steiner Tree Problem in n-space

Solving the Euclidean Steiner Tree Problem in n-space Marcia Fampa (UFRJ), Jon Lee (U. Michigan), and Wendel Melo (UFRJ) January 2015 Marcia Fampa, Jon Lee, Wendel Melo Solving the Euclidean Steiner Tree

### A Row-and-Column Generation Method to a Batch Machine Scheduling Problem

The Ninth International Symposium on Operations Research and Its Applications (ISORA 10) Chengdu-Jiuzhaigou, China, August 19 23, 2010 Copyright 2010 ORSC & APORC, pp. 301 308 A Row-and-Column Generation

### Decreasing a key FIB-HEAP-DECREASE-KEY(,, ) 3.. NIL. 2. error new key is greater than current key 6. CASCADING-CUT(, )

Decreasing a key FIB-HEAP-DECREASE-KEY(,, ) 1. if >. 2. error new key is greater than current key 3.. 4.. 5. if NIL and.

### 3 No-Wait Job Shops with Variable Processing Times

3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select

### AN EXACT ALGORITHM FOR A LOCATION-ROUTING PROBLEM. Martine Labbé 1, Inmaculada Rodríguez Martín 2, Juan José Salazar González 2

27 Congreso Nacional de Estadística e Investigación Operativa Lleida, 8 11 de abril de 2003 AN EXACT ALGORITHM FOR A LOCATION-ROUTING PROBLEM Martine Labbé 1, Inmaculada Rodríguez Martín 2, Juan José Salazar

### CS261: Problem Set #2

CS261: Problem Set #2 Due by 11:59 PM on Tuesday, February 9, 2016 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Submission instructions:

### In the classical vehicle-routing problem (VRP) the objective is to service some geographically scattered customers

TRANSPORTATION SCIENCE Vol. 38, No. 2, May 2004, pp. 197 209 issn 0041-1655 eissn 1526-5447 04 3802 0197 informs doi 10.1287/trsc.1030.0053 2004 INFORMS Scheduling Transportation of Live Animals to Avoid

### Chapter 9 Graph Algorithms

Introduction graph theory useful in practice represent many real-life problems can be if not careful with data structures Chapter 9 Graph s 2 Definitions Definitions an undirected graph is a finite set

### COMP 355 Advanced Algorithms Approximation Algorithms: VC and TSP Chapter 11 (KT) Section (CLRS)

COMP 355 Advanced Algorithms Approximation Algorithms: VC and TSP Chapter 11 (KT) Section 35.1-35.2(CLRS) 1 Coping with NP-Completeness Brute-force search: This is usually only a viable option for small

### J Linear Programming Algorithms

Simplicibus itaque verbis gaudet Mathematica Veritas, cum etiam per se simplex sit Veritatis oratio. [And thus Mathematical Truth prefers simple words, because the language of Truth is itself simple.]

### Chapter 9 Graph Algorithms

Chapter 9 Graph Algorithms 2 Introduction graph theory useful in practice represent many real-life problems can be if not careful with data structures 3 Definitions an undirected graph G = (V, E) is a

### A List Heuristic for Vertex Cover

A List Heuristic for Vertex Cover Happy Birthday Vasek! David Avis McGill University Tomokazu Imamura Kyoto University Operations Research Letters (to appear) Online: http://cgm.cs.mcgill.ca/ avis revised:

### Kurt Mehlhorn, MPI für Informatik. Curve and Surface Reconstruction p.1/25

Curve and Surface Reconstruction Kurt Mehlhorn MPI für Informatik Curve and Surface Reconstruction p.1/25 Curve Reconstruction: An Example probably, you see more than a set of points Curve and Surface

### L2: Algorithms: Knapsack Problem & BnB

L2: Algorithms: Knapsack Problem & BnB This tutorial covers the basic topics on creating a forms application, common form controls and the user interface for the optimization models, algorithms and heuristics,

### Lecture 8: The Traveling Salesman Problem

Lecture 8: The Traveling Salesman Problem Let G = (V, E) be an undirected graph. A Hamiltonian cycle of G is a cycle that visits every vertex v V exactly once. Instead of Hamiltonian cycle, we sometimes

### Chapter 9 Graph Algorithms

Chapter 9 Graph Algorithms 2 Introduction graph theory useful in practice represent many real-life problems can be slow if not careful with data structures 3 Definitions an undirected graph G = (V, E)

### 1 The Traveling Salesperson Problem (TSP)

CS 598CSC: Approximation Algorithms Lecture date: January 23, 2009 Instructor: Chandra Chekuri Scribe: Sungjin Im In the previous lecture, we had a quick overview of several basic aspects of approximation

### Questions? You are given the complete graph of Facebook. What questions would you ask? (What questions could we hope to answer?)

P vs. NP What now? Attribution These slides were prepared for the New Jersey Governor s School course The Math Behind the Machine taught in the summer of 2011 by Grant Schoenebeck Large parts of these

### Towards Efficient Higher-Order Semidefinite Relaxations for Max-Cut

Towards Efficient Higher-Order Semidefinite Relaxations for Max-Cut Miguel F. Anjos Professor and Canada Research Chair Director, Trottier Energy Institute Joint work with E. Adams (Poly Mtl), F. Rendl,

### Lecture 4: Primal Dual Matching Algorithm and Non-Bipartite Matching. 1 Primal/Dual Algorithm for weighted matchings in Bipartite Graphs

CMPUT 675: Topics in Algorithms and Combinatorial Optimization (Fall 009) Lecture 4: Primal Dual Matching Algorithm and Non-Bipartite Matching Lecturer: Mohammad R. Salavatipour Date: Sept 15 and 17, 009

### / Approximation Algorithms Lecturer: Michael Dinitz Topic: Linear Programming Date: 2/24/15 Scribe: Runze Tang

600.469 / 600.669 Approximation Algorithms Lecturer: Michael Dinitz Topic: Linear Programming Date: 2/24/15 Scribe: Runze Tang 9.1 Linear Programming Suppose we are trying to approximate a minimization

### Dynamic programming. Trivial problems are solved first More complex solutions are composed from the simpler solutions already computed

Dynamic programming Solves a complex problem by breaking it down into subproblems Each subproblem is broken down recursively until a trivial problem is reached Computation itself is not recursive: problems

### Assignment 3b: The traveling salesman problem

Chalmers University of Technology MVE165 University of Gothenburg MMG631 Mathematical Sciences Linear and integer optimization Optimization with applications Emil Gustavsson Assignment information Ann-Brith

### 2.1 Greedy Algorithms. 2.2 Minimum Spanning Trees. CS125 Lecture 2 Fall 2016

CS125 Lecture 2 Fall 2016 2.1 Greedy Algorithms We will start talking about methods high-level plans for constructing algorithms. One of the simplest is just to have your algorithm be greedy. Being greedy,

### Module 1 Lecture Notes 2. Optimization Problem and Model Formulation

Optimization Methods: Introduction and Basic concepts 1 Module 1 Lecture Notes 2 Optimization Problem and Model Formulation Introduction In the previous lecture we studied the evolution of optimization

### Primal Heuristics for Branch-and-Price Algorithms

Primal Heuristics for Branch-and-Price Algorithms Marco Lübbecke and Christian Puchert Abstract In this paper, we present several primal heuristics which we implemented in the branch-and-price solver GCG

### 11.1 Facility Location

CS787: Advanced Algorithms Scribe: Amanda Burton, Leah Kluegel Lecturer: Shuchi Chawla Topic: Facility Location ctd., Linear Programming Date: October 8, 2007 Today we conclude the discussion of local

### Reach for A : an Efficient Point-to-Point Shortest Path Algorithm

Reach for A : an Efficient Point-to-Point Shortest Path Algorithm Andrew V. Goldberg Microsoft Research Silicon Valley www.research.microsoft.com/ goldberg/ Joint with Haim Kaplan and Renato Werneck Einstein

### 5.4 Pure Minimal Cost Flow

Pure Minimal Cost Flow Problem. Pure Minimal Cost Flow Networks are especially convenient for modeling because of their simple nonmathematical structure that can be easily portrayed with a graph. This

### Algorithm Design Techniques. Hwansoo Han

Algorithm Design Techniques Hwansoo Han Algorithm Design General techniques to yield effective algorithms Divide-and-Conquer Dynamic programming Greedy techniques Backtracking Local search 2 Divide-and-Conquer

### Leveraging Set Relations in Exact Set Similarity Join

Leveraging Set Relations in Exact Set Similarity Join Xubo Wang, Lu Qin, Xuemin Lin, Ying Zhang, and Lijun Chang University of New South Wales, Australia University of Technology Sydney, Australia {xwang,lxue,ljchang}@cse.unsw.edu.au,

### An 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

### Point-to-Point Shortest Path Algorithms with Preprocessing

Point-to-Point Shortest Path Algorithms with Preprocessing Andrew V. Goldberg Microsoft Research Silicon Valley www.research.microsoft.com/ goldberg/ Joint work with Chris Harrelson, Haim Kaplan, and Retato

### NP-Hardness. We start by defining types of problem, and then move on to defining the polynomial-time reductions.

CS 787: Advanced Algorithms NP-Hardness Instructor: Dieter van Melkebeek We review the concept of polynomial-time reductions, define various classes of problems including NP-complete, and show that 3-SAT

### Supplementary Notes to Networks and Integer Programming

Supplementary Notes to Networks and Integer Programming Jesper Larsen Jens Clausen Kongens Lyngby 009 Technical University of Denmark Department of Management Engineering DK-800 Kongens Lyngby, Denmark

### Combinatorial Optimization - Lecture 14 - TSP EPFL

Combinatorial Optimization - Lecture 14 - TSP EPFL 2012 Plan Simple heuristics Alternative approaches Best heuristics: local search Lower bounds from LP Moats Simple Heuristics Nearest Neighbor (NN) Greedy

### Approximation 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

### ALGORITHM CHEAPEST INSERTION

Version for STSP ALGORITHM CHEAPEST INSERTION. Choose the two furthest vertices i and k as initial subtour (c ik = max {c hj : (h, j) A}); set V := V \ {i} \ {k} (set of the unvisited vertices).. For each

### Approximation algorithms for the bottleneck stretch factor problem

Approximation algorithms for the bottleneck stretch factor problem Giri Narasimhan Michiel Smid December 8, 2000 Abstract The stretch factor of a Euclidean graph is the maximum ratio of the distance in

### Introduction to Combinatorial Algorithms

Fall 2009 Intro Introduction to the course What are : Combinatorial Structures? Combinatorial Algorithms? Combinatorial Problems? Combinatorial Structures Combinatorial Structures Combinatorial structures

### Efficient QoS Partition and Routing in Multiservice IP Networks

Efficient QoS Partition and Routing in Multiservice IP Networks I. Atov H. T. Tran R. J. Harris RMIT University Melbourne Box 2476V Vic. 3001, Australia Abstract This paper considers the combined problem

### 1 Variations of the Traveling Salesman Problem

Stanford University CS26: Optimization Handout 3 Luca Trevisan January, 20 Lecture 3 In which we prove the equivalence of three versions of the Traveling Salesman Problem, we provide a 2-approximate algorithm,

### Strongly Connected Spanning Subgraph for Almost Symmetric Networks

CCC 2015, Kingston, Ontario, August 10 12, 2015 Strongly Connected Spanning Subgraph for Almost Symmetric Networks A. Karim Abu-Affash Paz Carmi Anat Parush Tzur Abstract In the strongly connected spanning

### Algorithm Design, Anal. & Imp., Homework 4 Solution

Algorithm Design, Anal. & Imp., Homework 4 Solution Note: The solution is for your personal use for this course. You are not allowed to post the solution in public place. There could be mistakes in the

### Graphs and Network Flows ISE 411. Lecture 7. Dr. Ted Ralphs

Graphs and Network Flows ISE 411 Lecture 7 Dr. Ted Ralphs ISE 411 Lecture 7 1 References for Today s Lecture Required reading Chapter 20 References AMO Chapter 13 CLRS Chapter 23 ISE 411 Lecture 7 2 Minimum

### Disjunctive cuts in branch-and-but-and-price algorithms Application to the capacitated vehicle routing problem

Disjunctive cuts in branch-and-but-and-price algorithms Application to the capacitated vehicle routing problem Stefan Ropke Technical University of Denmark, Department of Transport (DTU Transport) Column

### Approximation Algorithms

Presentation for use with the textbook, Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015 Approximation Algorithms Tamassia Approximation Algorithms 1 Applications One of

### Solution Methods for the Multi-trip Elementary Shortest Path Problem with Resource Constraints

Solution Methods for the Multi-trip Elementary Shortest Path Problem with Resource Constraints Zeliha Akca Ted K. Ralphs Rosemary T. Berger December 31, 2010 Abstract We investigate the multi-trip elementary

### The Generalized Weapon Target Assignment Problem

10th International Command and Control Research and Technology Symposium The Future of C2 June 13-16, 2005, McLean, VA The Generalized Weapon Target Assignment Problem Jay M. Rosenberger Hee Su Hwang Ratna

### CLASS: II YEAR / IV SEMESTER CSE CS 6402-DESIGN AND ANALYSIS OF ALGORITHM UNIT I INTRODUCTION

CLASS: II YEAR / IV SEMESTER CSE CS 6402-DESIGN AND ANALYSIS OF ALGORITHM UNIT I INTRODUCTION 1. What is performance measurement? 2. What is an algorithm? 3. How the algorithm is good? 4. What are the

### Problem set 2. Problem 1. Problem 2. Problem 3. CS261, Winter Instructor: Ashish Goel.

CS261, Winter 2017. Instructor: Ashish Goel. Problem set 2 Electronic submission to Gradescope due 11:59pm Thursday 2/16. Form a group of 2-3 students that is, submit one homework with all of your names.

### Minimum-Spanning-Tree problem. Minimum Spanning Trees (Forests) Minimum-Spanning-Tree problem

Minimum Spanning Trees (Forests) Given an undirected graph G=(V,E) with each edge e having a weight w(e) : Find a subgraph T of G of minimum total weight s.t. every pair of vertices connected in G are

### CSC 373: Algorithm Design and Analysis Lecture 4

CSC 373: Algorithm Design and Analysis Lecture 4 Allan Borodin January 14, 2013 1 / 16 Lecture 4: Outline (for this lecture and next lecture) Some concluding comments on optimality of EST Greedy Interval

### An iteration of Branch and Bound One iteration of Branch and Bound consists of the following four steps: Some definitions. Branch and Bound.

ranch and ound xamples and xtensions jesla@man.dtu.dk epartment of Management ngineering Technical University of enmark ounding ow do we get ourselves a bounding function? Relaxation. Leave out some constraints.

### Stochastic Separable Mixed-Integer Nonlinear Programming via Nonconvex Generalized Benders Decomposition

Stochastic Separable Mixed-Integer Nonlinear Programming via Nonconvex Generalized Benders Decomposition Xiang Li Process Systems Engineering Laboratory Department of Chemical Engineering Massachusetts

### Introduction 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

### Primal Heuristics in SCIP

Primal Heuristics in SCIP Timo Berthold Zuse Institute Berlin DFG Research Center MATHEON Mathematics for key technologies Berlin, 10/11/2007 Outline 1 Introduction Basics Integration Into SCIP 2 Available

### VNS-based heuristic with an exponential neighborhood for the server load balancing problem

Available online at www.sciencedirect.com Electronic Notes in Discrete Mathematics 47 (2015) 53 60 www.elsevier.com/locate/endm VNS-based heuristic with an exponential neighborhood for the server load

### Outline. Best-first search

Outline Best-first search Greedy best-first search A* search Heuristics Admissible Heuristics Graph Search Consistent Heuristics Local search algorithms Hill-climbing search Beam search Simulated annealing

### Separators in High-Genus Near-Planar Graphs

Rochester Institute of Technology RIT Scholar Works Theses Thesis/Dissertation Collections 12-2016 Separators in High-Genus Near-Planar Graphs Juraj Culak jc1789@rit.edu Follow this and additional works

### Introduction to Algorithms

Introduction to Algorithms 6.046J/18.401J Lecture 24 Prof. Piotr Indyk Dealing with Hard Problems What to do if: Divide and conquer Dynamic programming Greedy Linear Programming/Network Flows does not

### Linear programming and duality theory

Linear programming and duality theory Complements of Operations Research Giovanni Righini Linear Programming (LP) A linear program is defined by linear constraints, a linear objective function. Its variables

### 15-451/651: Design & Analysis of Algorithms November 4, 2015 Lecture #18 last changed: November 22, 2015

15-451/651: Design & Analysis of Algorithms November 4, 2015 Lecture #18 last changed: November 22, 2015 While we have good algorithms for many optimization problems, the previous lecture showed that many

### Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest. Introduction to Algorithms

Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Introduction to Algorithms Preface xiii 1 Introduction 1 1.1 Algorithms 1 1.2 Analyzing algorithms 6 1.3 Designing algorithms 1 1 1.4 Summary 1 6

### Capturing Topology in Graph Pattern Matching

Capturing Topology in Graph Pattern Matching Shuai Ma, Yang Cao, Wenfei Fan, Jinpeng Huai, Tianyu Wo University of Edinburgh Graphs are everywhere, and quite a few are huge graphs! File systems Databases

### Branch-and-cut implementation of Benders decomposition Matteo Fischetti, University of Padova

Branch-and-cut implementation of Benders decomposition Matteo Fischetti, University of Padova 8th Cargese-Porquerolles Workshop on Combinatorial Optimization, August 2017 1 Mixed-Integer Programming We

### Design and Analysis of Algorithms

CSE 101, Winter 2018 Design and Analysis of Algorithms Lecture 9: Minimum Spanning Trees Class URL: http://vlsicad.ucsd.edu/courses/cse101-w18/ Goal: MST cut and cycle properties Prim, Kruskal greedy algorithms

### Local search heuristic for multiple knapsack problem

International Journal of Intelligent Information Systems 2015; 4(2): 35-39 Published online February 14, 2015 (http://www.sciencepublishinggroup.com/j/ijiis) doi: 10.11648/j.ijiis.20150402.11 ISSN: 2328-7675

### Traveling Salesman Problem (TSP) Input: undirected graph G=(V,E), c: E R + Goal: find a tour (Hamiltonian cycle) of minimum cost

Traveling Salesman Problem (TSP) Input: undirected graph G=(V,E), c: E R + Goal: find a tour (Hamiltonian cycle) of minimum cost Traveling Salesman Problem (TSP) Input: undirected graph G=(V,E), c: E R

### Clustering for Faster Network Simplex Pivots

Clustering for Faster Network Simplex Pivots David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717 Tech. Report 93-19 April 15, 1993 Abstract We show

### On Clarkson s Las Vegas Algorithms for Linear and Integer Programming When the Dimension is Small

On Clarkson s Las Vegas Algorithms for Linear and Integer Programming When the Dimension is Small Robert Bassett March 10, 2014 2 Question/Why Do We Care Motivating Question: Given a linear or integer

### P and NP (Millenium problem)

CMPS 2200 Fall 2017 P and NP (Millenium problem) Carola Wenk Slides courtesy of Piotr Indyk with additions by Carola Wenk CMPS 2200 Introduction to Algorithms 1 We have seen so far Algorithms for various

### Hyperbolic Traffic Load Centrality for Large-Scale Complex Communications Networks

ICT 2016: 23 rd International Conference on Telecommunications Hyperbolic Traffic Load Centrality for Large-Scale Complex Communications Networks National Technical University of Athens (NTUA) School of

### Modified Order Crossover (OX) Operator

Modified Order Crossover (OX) Operator Ms. Monica Sehrawat 1 N.C. College of Engineering, Israna Panipat, Haryana, INDIA. Mr. Sukhvir Singh 2 N.C. College of Engineering, Israna Panipat, Haryana, INDIA.

### Lecture 13. Reading: Weiss, Ch. 9, Ch 8 CSE 100, UCSD: LEC 13. Page 1 of 29

Lecture 13 Connectedness in graphs Spanning trees in graphs Finding a minimal spanning tree Time costs of graph problems and NP-completeness Finding a minimal spanning tree: Prim s and Kruskal s algorithms

### Implementing Constraint Handlers in SCIP

Implementing Constraint Handlers in SCIP Gregor Hendel Ambros Gleixner, Felipe Serrano September 30 Outline Why use constraints? Motivation Callback: Default Constraint Handlers of SCIP Implementation

### VIRTUAL PATH LAYOUT DESIGN VIA NETWORK CLUSTERING

VIRTUAL PATH LAYOUT DESIGN VIA NETWORK CLUSTERING MASSIMO ANCONA 1 WALTER CAZZOLA 2 PAOLO RAFFO 3 IOAN BOGDAN VASIAN 4 Area of interest: Telecommunication Networks Management Abstract In this paper two

### Discrete Optimization with Decision Diagrams

Discrete Optimization with Decision Diagrams J. N. Hooker Joint work with David Bergman, André Ciré, Willem van Hoeve Carnegie Mellon University Australian OR Society, May 2014 Goal Find an alternative

### MA4254: Discrete Optimization. Defeng Sun. Department of Mathematics National University of Singapore Office: S Telephone:

MA4254: Discrete Optimization Defeng Sun Department of Mathematics National University of Singapore Office: S14-04-25 Telephone: 6516 3343 Aims/Objectives: Discrete optimization deals with problems of

Iterative Improvement Algorithm design technique for solving optimization problems Start with a feasible solution Repeat the following step until no improvement can be found: change the current feasible

### 6. Lecture notes on matroid intersection

Massachusetts Institute of Technology 18.453: Combinatorial Optimization Michel X. Goemans May 2, 2017 6. Lecture notes on matroid intersection One nice feature about matroids is that a simple greedy algorithm

### Parallel Branch & Bound

Parallel Branch & Bound Bernard Gendron Université de Montréal gendron@iro.umontreal.ca Outline Mixed integer programming (MIP) and branch & bound (B&B) Linear programming (LP) based B&B Relaxation and

### Assignment and Matching

Assignment and Matching By Geetika Rana IE 680 Dept of Industrial Engineering 1 Contents Introduction Bipartite Cardinality Matching Problem Bipartite Weighted Matching Problem Stable Marriage Problem

### Constructive and destructive algorithms

Constructive and destructive algorithms Heuristic algorithms Giovanni Righini University of Milan Department of Computer Science (Crema) Constructive algorithms In combinatorial optimization problems every

### The Encoding Complexity of Network Coding

The Encoding Complexity of Network Coding Michael Langberg Alexander Sprintson Jehoshua Bruck California Institute of Technology Email: mikel,spalex,bruck @caltech.edu Abstract In the multicast network