Local Search Approximation Algorithms for the Complement of the Min-k-Cut Problems
|
|
- Samantha Bridges
- 6 years ago
- Views:
Transcription
1 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 , China Abstract Min-k-cut is the problem of partitioning vertices of a given graph or hypergraph into k subsets such that the total weight of edges or hyperedges crossing different subsets is minimized. For the capacitated min-k-cut problem, each edge has a nonnegative weight, and each subset has a possibly different capacity that imposes an upper bound on its size. The objective is to find a partition that minimizes the sum of edge weights on all pairs of vertices that lie in different subsets. The min-k-cut problem is NP-hard for k 3, and the capacitated min-k-cut problem is also NP-hard for k 2. Min-k-cut has numerous applications, for example, VLSI circuit partitioning, which is a key step in VLSI CAD. Although many heuristics have been proposed for min-k-cut problems, there are few approximation results of min-k-cut problems. We study the equivalent complement problem of the min-k-cut problem, which attempts to maximize the total weight of edges in every subset. We extend the method proposed in [15] to present deterministic local search approximation algorithms for the complement problem of the min-k-cut problem, and the complement problem of the capacitated min-k-cut problem on graph with performance ratio 1 k. Key words: min-k-cut, approximation algorithm, local search. 1 Introduction The min-cut problem takes as input an undirected graph with non-negative edge weights. The objective of the problem is to find a partition of the vertices into two subsets, such that the sum of weights of edges between the two subsets is minimized. A prototypical problem in this family is the min-k-cut problem: given an input undirected graph G = (V, E) with edge weights d: E R + and an integer k, partition the graph vertices into k parts, so as to minimize the total weight of the edges connecting different parts. In particular, each subset has a possibly different capacity that imposes an upper bound on its size, and the objective is to find a partition that minimizes the sum of edge weights on all pairs of vertices that lie in different subsets. This is the capacitated min-k-cut problem. When partition the graph vertices into k parts of equal size to minimize the total weight of the edges connecting different parts, the problem is called the min-k-cut balanced problem. The special case k = 2 is the famous minimum bisection problem, which is already known to be NP-hard [14]. Consequently, a long line of research has been devoted to polynomialtime approximation of various graph partitioning problems. There are some approximation results for the minimum multiway cut problem: given a weighted graph G with a set of terminal nodes T and weights on edges, the goal is to find the smallest cut separating all the terminals. Let k = T denote the cardinality of the terminal set. When k = 2, the problem reduces to the simple min-cut problem and hence is polynomial-time solvable. For k 3, it is known that the problem is NP-Hard and also APX-Hard [7]. Dahlhaus et al. [7] provided a greedy approximation algorithm 1
2 for the minimum multiterminal cut problem and gave a tight analysis to show that it achieves an approximation factor of 2(1 1 k ). Although the analysis provided is tight, better algorithms exist for the minimum multiterminal cut problem. Calinescu et al. [5] gave a k approximation algorithm, which was subsequently improved to a approximation algorithm by Karger et al. [9] for a geometric embedding of the problem. For the capacitated min-k-cut problem, which to our knowledge there exist few approximation results. However, related work on the min-k-cut balanced problem has been marked by striking breakthroughs in designing approximation algorithms with provable performance guarantees. In fact, Andreev and Räcke [2] proved that bi-criteria approximation is inevitable in the sense that, unless P=NP, the min-k-cut balanced problem has no polynomial time approximation within any finite factor. Leighton, et al. [24] and Simon and Teng [29] designed approximation algorithms based on recursively finding a minimum bisection for the min-k-cut balanced problem. This algorithm achieves an O(log k log n) approximation, when using the minimum bisection algorithm due to [3]. Using a more direct linear programming (LP) relaxation of partitioning problems called spreading metrics, Even et al. [10] designed an algorithm for this problem, achieving an approximation factor of O(log n). Andreev and Räcke [2] used a more sophisticate recursive partitioning together with dynamic programming to obtain an O(ɛ 2 log 1.5 n) approximation for any fixed ε > 0. Krauthgamer et al. [22] presented a polynomial-time (bi-criteria) approximation algorithm achieving an approximation of O( log n log k). Works on approximation algorithms for the minimum bisection problem have proved to be extremely fruitful. It is best illustrated by briefly mentioning a few key results regarding minimum bisection: the O(log n) bi-criteria approximation by Leighton and Rao [25], as well as the improvement to O( log n) by Arora et al. [3]. They approximated minimum bisection via a closely related problem of sparsest cuts. Räcke [27] obtained a remarkable O(log n) approximation, which improves the previous O(log 1.5 n) by Feige and Krauthgamer [12]. The previous best-known results for this problem are based on linear programming relaxation [16] or SDP relaxation [13]. Srivastav and Wolf [30] gave a 0.48-approximation algorithm using a different SDP relaxation. In fact, Srivastav and Wolf have proved that the SDP relaxation used in their analysis yields at most 0.5 approximation of dense-n/2-subgraph. Crossing the 0.5 barrier, Ye and Zhang [31] presented an approximation guarantee of using a Goemans-Williamson-style algorithm [17] based on the semidefinite programming relaxation. Finally, different inapproximability results shown in a sequence of papers [6, 8, 11, 21, 23], relate minimum bisection to the unique games conjecture [20], and to refuting random 3SAT formulas. This makes it possible to investigate minimum bisection in another area. In this paper, we develop and investigate local search approaches for the complement problem of the min-k-cut problem on graph, and the complement problem of the capacitated min-k-cut problem of graph. Our method is based on the local search method proposed in [15] for the capacitated max-k-cut problem. Noting that the min-k-cut problem is not equivalent to the max-k-cut problem, and no approximation results have been established for local search methods for the general min-k-cut problem, we think the results presented in this paper are interesting. The paper is organized as follows. We first present in Section 2 a local search algorithm for the complement problem of the min-k-cut problem on graph, which provides an approximation guarantee 1 k. In Section 3, we study a local search algorithm for the complement problem of the capacitated min-k-cut problem on graph, and show that the solution obtained has an approximation ratio 1 k. Finally, conclusions are made in Section 4. 2
3 2 Complement of the min-k-cut problem on graph Let G(V, E) be a graph with V = n vertices. Let edge e E connect vertices u, v V, and let d(u, v) be a non-negative weight on edge e = (u, v). We consider the problem of partitioning the set V into k subsets, V 1,..., V k, such that the sum of weights of edges in every subset is as large as possible. This is an equivalent problem of the min-k-cut problem. We consider a local search method for it, which is a Lin-Kernighan like algorithm. 2.1 Local search algorithm Our proposed algorithm begins with an arbitrary partitioning of the vertices, and moves a vertex from one subset to another if the sum of weights of edges in every subset increases. The algorithm stops when no further improvements can be attained by all possible moving of one vertex. Let d(u, V i ) = v V i,v u d(u, v) be the sum of weights of the edges from vertex u to the vertices in the subset V i. We consider the performance of the following local-search algorithm: Initialization step Partition the vertices into k sets, V 1,..., V k, by arbitrarily assigning vertices to V i, for all i = 1,..., k. Iterative step Determine if there is a vertex u V i and subset V j, i j, such that d(u, V i ) < d(u, V j ). If such a vertex exists, move u from V i to V j, and repeat this step. Termination step When d(u, V i ) d(u, V j ), for all i, j, i j, and for all u V i, the algorithm ends. 2.2 Worst-case analysis of the algorithm Now we characterize the worst-case bound of the local-search algorithm for graph for all k 3. Let OP T denote the optimal value of an instance of the complement problem of the min-k-cut problem on graph. Let V 1,..., V k be a solution obtained using the local-search algorithm. Let ALG denote the objective value of the solution V 1,..., V k. Let d(v i, V i ) denote the sum of weights of edges with both ends in V i. Let d(v i, V j ) denote the sum of weights of edges that connect a vertex in V i to a vertex in V j, and let d cut denote the sum of weights of the cut edges. Thus, and k ALG = d(v i, V i ), i=1 d cut = d(v i, V j ), i=1 j=i+1 ALG + d cut = e E d(e). 3
4 Theorem 1. The solution obtained using the local-search algorithm has an objective value not smaller than 1 k of the optimal value. Proof When the local search algorithm stops, we have d(u, V i ) d(u, V j ), for all i, j, i j, and for all u V i. We sum both sides of the above inequality over all u V i and get d(u, V i ) d(u, V j ). (1) u V i u V i Since each edge weight is added two times while computing d(v i, V i ), we have Moreover, since inequality (1) leads to u V i d(u, V i ) = 2d(V i, V i ). u V i d(u, V j ) = d(v i, V j ), 2d(V i, V i ) d(v i, V j ). Summing both sides of the above inequality over all i, j = 1,, k, i j, gives Since 2 d(v i, V i ) d(v i, V j ). (2) inequality (2) results in, d(v i, V j ) = 2 d(v i, V j ), i=1 j=i+1 which follows that 2 d(v i, V i ) 2 d(v i, V j ), i=1 j=i+1 k (k 1) d(v i, V i ) i=1 The above inequality can be rewritten as d(v i, V j ). i=1 j=i+1 Therefore, and we get (k 1)ALG d cut. OP T d cut + ALG ALG + (k 1)ALG, ALG OP T 1 k. 4
5 2.3 Running time Now we analyze running time of the above local-search algorithm. Each iterative step involves examining at most V vertices and selecting one that decreases the cut value. This process takes at most O( V 2 ) time. Since we assume that edges have non-negative weights, the sum of weights of the edges in every subset is increased after each iteration. The maximum possible sum of weights of the edges in every subset is d(e), hence there are at most such number of iterations. So the overall time complexity of this algorithm is O( V 2 d(e)). For the special case of unweighted graphs (all weights equal to 1), the e E time complexity becomes O( V 4 ), which is strongly polynomial in the input size. 3 Complement of the capacitated min-k-cut problem on graph Let G(V, E) be a graph with V = n vertices. Let edge e E connect vertices u, v V, and let d(u, v) be a non-negative weight on edge e = (u, v). We consider the problem of partitioning the set V into k subsets, V 1,..., V k, where the i-th subset V k contains at most p i vertices, and V k i=1 p i, such that the sum of weights of edges in every subset is as large as possible. 3.1 Local search method Our proposed algorithm begins with an arbitrary partitioning of the vertices, with size of each subset not greater than the capacity constraint. It searches in a neighborhood comprising all pairs of vertices that lie in different subsets, and evaluates the value of a switch by comparing the sum of edge weights with and without flipping a pair of vertices. The algorithm stops when no further improvements can be attained the sum of weights of edges in every subset. Let d(u, V i ) = v V i,v u d(u, v) denote the sum of weights of the edges from vertex u to the vertices in the subset V i. We consider the following local-search algorithm: Initialization step Partition the vertices into k sets, V 1,..., V k, by arbitrarily assigning V i p i vertices to V i, i = 1,..., k. Iterative step Determine if there is a pair of vertices u V i and v V j, i j, such that V i d(u, V i ) + V j d(v, V j ) < V i d(u, V j ) + V j d(v, V i ). If such a pair of vertices exist, reassign vertex u to V j, vertex v to V i, and repeat this step. Termination step When V i d(u, V i ) + V j d(v, V j ) V i d(u, V j ) + V j d(v, V i ), for all i, j, i j, and for all u V i, the algorithm stops. 3.2 Running time In general, local-search algorithms that run in polynomial time have proved elusive for combinatorially-hard problems. If all edge weights are equal, especially, if the objective is to maximize the number of edges in all subsets, then the above local search procedure runs e E 5
6 in time O(n 3 m), where n is the number of vertices and m is the number of edges in the graph. Let us analyze running time of the above local search algorithm for this special case of problem. Each iterative step involves examining at most O(n 2 ) vertices and selecting two vertices that increases the number of edges lying in the same part when swaped. This process takes O(n 3 ) time. Since we assume that edges have equal weights, the number of edges lying in the same part is increased after each iteration. The maximum possible objective value is m, hence there are at most such number of iterations. The overall time complexity of this algorithm is thus O(n 3 m), which is strongly polynomial in the input size. Johnson et al. [18] introduced polynomial-time local search (PLS), a complexity class containing problems that are equally hard in the sense that, if a locally optimal solution can be found in polynomial time for one problem, then such a solution can be found for all problems in the class. Problems in this class are called PLS-complete. The complement problem of the capacitated Max-k-Cut problem is NP-Hard, and it appears unlikely that it admits a polynomial time local-search procedure. Orlin et al. [26] provided a locally optimal approximation scheme for every problem in PLS. By these results, the problem of obtaining such a locally optimal solution for the general weighted version of the capacitated min-k-cut problem is PLS-complete. 3.3 Worst-case analysis of the algorithm The following theorem characterizes the worst-case bound on the quality of the local-search algorithm for all k 2. Theorem 2. The solution obtained using the local search algorithm has a value not smaller than 1 k of the optimal value of the complement problem of the capacitated min-kcut problem. Proof As the solution returned by the local search algorithm satisfies, V i d(u, V i ) + V j d(v, V j ) V i d(u, V j ) + V j d(v, V i ), for all i, j, i j, and for all u V i. We sum both sides of the above expression over all u V i and get V i u V i d(u, V i ) + V i V j d(v, V j ) V i u V i d(u, V j ) + V i V j d(v, V i ). Next, we sum both sides of the above inequality over all v V j and get V i V j u V i d(u, V i ) + V i V j v V j d(v, V j ) V i V j u V i d(u, V j ) + V i V j v V j d(v, V i ). Note that, u V i d(u, V j ) = d(v i, V j ), v V j d(v, V i ) = d(v j, V i ). Since each edge weight is added two times when computing d(v i, V i ) and d(v j, V j ), we have (3) 6
7 Thus inequality (3) leads to u V i d(u, V i ) = 2d(V i, V i ), v V j d(v, V j ) = 2d(V j, V j ). 2 V i V j (d(v i, V i ) + d(v j, V j )) V i V j (d(v i, V j ) + d(v j, V i )). Since d(v i, V j ) = d(v j, V i ), we get d(v i, V i ) + d(v j, V j ) d(v i, V j ). Summing both sides of the above inequality over all i, j = 1,, k, i j, gives Since (d(v i, V i ) + d(v j, V j )) d(v i, V j ). (4) and by (4), we have d(v i, V j ) = 2 d(v i, V j ) = 2d cut, i=1 j=i+1 It follows that (d(v i, V i ) + d(v j, V j )) 2d cut. k k (k 1)( d(v i, V i ) + d(v j, V j )) 2d cut. i=1 j=1 The above inequality can be rewritten as By k 2(k 1) d(v i, V i ) 2d cut. i=1 we get ALG = k d(v i, V i ), i=1 Therefore, which results in (k 1)ALG d cut. OP T d cut + ALG ALG + (k 1)ALG, ALG OP T 1 k. 7
8 4 Conclusions Min-k-cut has wide applications in various field. While heuristic methods for the min-kcut problem flourish, there has been little advance in approximation results of algorithms for the min-k-cut problem. In this paper, we succeeded in presenting deterministic local search approximation algorithms for the complement problems of min-k-cut problem and the capacitated min-k-cut problem on graph, and achieving competitive approximation results. Improvement on the approximation ratios needs further investigation. References [1] C. J. Alpert and A. B. Kahng. Recent directions in netlist partitioning: A survey. Integration, the VLSI Journal, Vol. 19, Issue 1-2, pages 1-81,1995. [2] K. Andreev and H. Räcke. Balanced graph partitioning. Theory Comput. Syst., 39(6): , [3] S. Arora, S. Rao, and U. Vazirani. Expander flows, geometric embeddings, and graph partitionings. In 36th Annual Symposium on the Theory of Computing, pages , May [4] P. Berman and M. Karpinski. Approximability of hypergraph minimum bisection. Technical report, Mathematical Institute, Oxford University, [5] G. Calinescu, H. J. Karloff, Y. Rabani. An improved approximation algorithm for multiway cut. In STOC, pages 48-52, [6] S. Chawla, R. Krauthgamer, R. Kumar, Y. Rabani, and D. Sivakumar. On the hardness of approximating multicut and sparsest-cut. In 20th Annual IEEE Conference on Computational Complexity, pages , June [7] E. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, M. Yannakakis. The complexity of multiterminal cuts. SIAM J. Comput. Vol. 23, Pages , [8] N. R. Devanur, S. A. Khot, R. Saket, and N. K. Vishnoi. Integrality gaps for sparsest cut and minimum linear arrangement problems. In 38th Annual ACM Symposium on Theory of Computing, pages ACM Press, [9] D. R. Karger, P. N. Klein, C. Stein, M. Thorup, N. E. Young. Rounding algorithms for a geometric embedding of minimum multiway Cut. In STOC, pages , [10] G. Even, J. Naor, S. Rao, and B. Schieber. Fast approximate graph partitioning algorithms. SIAM J. Comput., 28(6): , [11] U. Feige. Relations between average case complexity and approximation complexity. In 34th Annual ACM Symposium on the Theory of Computing, pages , July [12] U. Feige and R. Krauthgamer. A polylogarithmic approximation of the minimum bisection. SIAM Review, 48(1): , [13] U. Feige, and M. Seltser. On the densest k-subgraph problem. Technical report, Department of Applied Mathematics and Computer Science, The Weizmann Institute, Rehovot,
9 [14] M. R. Garey, D. S. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theoret. Comput. Sci., 1(3): , [15] D. R. Gaur, R. Krishnamurti, and R. Kohli. The capacitated max k-cut problem, Math. Program., Ser. A, 115: 65-72, [16] M. X. Goemans. Mathematical programming and approximation algorithms. Lecture given at the Summer School on Approximation Solution of Hard Combinatorial Problems, Udine, [17] M. Goemans and D. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of ACM, 42: , [18] D. S. Johnson, C. H. Papadimitriou, and M. Yannakakis. How easy is local search? Journal of Computer and System. Sciences, 37, , [19] G. Karypis and V. Kumar. Multilevel k-way hypergraph partitioning. Proc. 36th ACM Design Automation Conference, pages , [20] S. Khot. On the power of unique 2-prover 1-round games. In 34th Annual ACM Symposium on the Theory of Computing, pages , July [21] S. Khot and N. K. Vishnoi. The unique games conjecture, integrality gap for cut problems and the embeddability of negative type metrics into l 1. In 46th IEEE Annual Symposium on Foundations of Computer Science, pages 53-62, [22] R. Krauthgamer, J. S. Naory, and R. Schwartzz. Partitioning graphs into balanced components. In Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, Pages New York, NY, [23] R. Krauthgamer and Y. Rabani. Improved lower bounds for embeddings into L 1. In 17th annual ACM-SIAM symposium on Discrete algorithm, pages ACM, [24] F. Leighton, F. Makedon, and S. Tragoudas. Approximation algorithms for VLSI partition problems. In Proceedings of the IEEE International Symposium on Circuits and Systems, Pages , IEEE Computer Society Press, [25] T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM, 46(6): , [26] J. B. Orlin, A. P. Punnen, and A. S. Schulz. Approximate local search in combinatorial optimization. SIAM Journal on Computing, 33(5): , [27] H. Räcke. Optimal hierarchical decompositions for congestion minimization in networks. In Proceedings of 40th Annual ACM Symposium on Theory of Computing, Pages , [28] Y. G. Saab. A fast network bisection algorithm. IEEE transaction on Computers, 44: , [29] H. D. Simon and S. Teng. How good is recursive bisection? SIAM J. Sci. Comput., 18(5): , [30] A. Srivastav and K. Wolf. Finding dense subgraphs with semidefinite programming. Lecture Notes in Computer Science, Volume 1444, Pages ,
10 [31] Y. Ye and J. Zhang. Approximation of dense-n/2-subgraph and the complement of min-bisection. Journal of Global Optimization, vol. 25, Issue 1: 55-73,
1 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 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 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 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 informationBalanced Graph Partitioning
Balanced Graph Partitioning Konstantin Andreev Harald Räce ABSTRACT In this paper we consider the problem of (, ν)-balanced graph partitioning - dividing the vertices of a graph into almost equal size
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 informationComplexity Results on Graphs with Few Cliques
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 9, 2007, 127 136 Complexity Results on Graphs with Few Cliques Bill Rosgen 1 and Lorna Stewart 2 1 Institute for Quantum Computing and School
More informationCut Problems in Graphs with a Budget Constraint
Cut Problems in Graphs with a Budget Constraint Roee Engelberg 1, Jochen Könemann 2, Stefano Leonardi 3, and Joseph (Seffi) Naor 4 1 Computer Science Department, Technion, Haifa 32000, Israel roee@cs.technion.ac.il
More informationRandomized rounding of semidefinite programs and primal-dual method for integer linear programming. Reza Moosavi Dr. Saeedeh Parsaeefard Dec.
Randomized rounding of semidefinite programs and primal-dual method for integer linear programming Dr. Saeedeh Parsaeefard 1 2 3 4 Semidefinite Programming () 1 Integer Programming integer programming
More informationLecture 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 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 informationPolynomial Flow-Cut Gaps and Hardness of Directed Cut Problems
Polynomial Flow-Cut Gaps and Hardness of Directed Cut Problems Julia Chuzhoy Sanjeev Khanna November 22, 2006 Abstract We study the multicut and the sparsest cut problems in directed graphs. In the multicut
More informationThe Set Cover with Pairs Problem
The Set Cover with Pairs Problem Refael Hassin Danny Segev Abstract We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find
More informationAnalysis of an ( )-Approximation Algorithm for the Maximum Edge-Disjoint Paths Problem with Congestion Two
Analysis of an ( )-Approximation Algorithm for the Maximum Edge-Disjoint Paths Problem with Congestion Two Nabiha Asghar Department of Combinatorics & Optimization University of Waterloo, Ontario, Canada
More informationFennel: Streaming Graph Partitioning for Massive Scale Graphs
Fennel: Streaming Graph Partitioning for Massive Scale Graphs Charalampos E. Tsourakakis 1 Christos Gkantsidis 2 Bozidar Radunovic 2 Milan Vojnovic 2 1 Aalto University, Finland 2 Microsoft Research, Cambridge
More informationc 2002 Society for Industrial and Applied Mathematics
SIAM J. COMPUT. Vol. 31, No. 4, pp. 1090 1118 c 2002 Society for Industrial and Applied Mathematics A POLYLOGARITHMIC APPROXIMATION OF THE MINIMUM BISECTION URIEL FEIGE AND ROBERT KRAUTHGAMER Abstract.
More informationOn Approximating Minimum Vertex Cover for Graphs with Perfect Matching
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching Jianer Chen and Iyad A. Kanj Abstract It has been a challenging open problem whether there is a polynomial time approximation algorithm
More informationExpected Approximation Guarantees for the Demand Matching Problem
Expected Approximation Guarantees for the Demand Matching Problem C. Boucher D. Loker September 2006 Abstract The objective of the demand matching problem is to obtain the subset M of edges which is feasible
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 informationAlgorithm 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
More informationApproximability Results for the p-center Problem
Approximability Results for the p-center Problem Stefan Buettcher Course Project Algorithm Design and Analysis Prof. Timothy Chan University of Waterloo, Spring 2004 The p-center
More informationApproximation Algorithms
15-251: Great Ideas in Theoretical Computer Science Spring 2019, Lecture 14 March 5, 2019 Approximation Algorithms 1 2 SAT 3SAT Clique Hamiltonian- Cycle given a Boolean formula F, is it satisfiable? same,
More information3 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
More informationParameterized graph separation problems
Parameterized graph separation problems Dániel Marx Department of Computer Science and Information Theory, Budapest University of Technology and Economics Budapest, H-1521, Hungary, dmarx@cs.bme.hu Abstract.
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 information/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Approximation algorithms Date: 11/27/18
601.433/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Approximation algorithms Date: 11/27/18 22.1 Introduction We spent the last two lectures proving that for certain problems, we can
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 informationOn the Complexity of the Policy Improvement Algorithm. for Markov Decision Processes
On the Complexity of the Policy Improvement Algorithm for Markov Decision Processes Mary Melekopoglou Anne Condon Computer Sciences Department University of Wisconsin - Madison 0 West Dayton Street Madison,
More informationNon-Metric Multicommodity and Multilevel Facility Location
Non-Metric Multicommodity and Multilevel Facility Location Rudolf Fleischer, Jian Li, Shijun Tian, and Hong Zhu Department of Computer Science and Engineering Shanghai Key Laboratory of Intelligent Information
More informationBottleneck Steiner Tree with Bounded Number of Steiner Vertices
Bottleneck Steiner Tree with Bounded Number of Steiner Vertices A. Karim Abu-Affash Paz Carmi Matthew J. Katz June 18, 2011 Abstract Given a complete graph G = (V, E), where each vertex is labeled either
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 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 informationOn Covering a Graph Optimally with Induced Subgraphs
On Covering a Graph Optimally with Induced Subgraphs Shripad Thite April 1, 006 Abstract We consider the problem of covering a graph with a given number of induced subgraphs so that the maximum number
More informationA simple algorithm for 4-coloring 3-colorable planar graphs
A simple algorithm for 4-coloring 3-colorable planar graphs Ken-ichi Kawarabayashi 1 National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo 101-8430, Japan Kenta Ozeki 2 Department of
More informationRandomized Algorithms 2017A - Lecture 10 Metric Embeddings into Random Trees
Randomized Algorithms 2017A - Lecture 10 Metric Embeddings into Random Trees Lior Kamma 1 Introduction Embeddings and Distortion An embedding of a metric space (X, d X ) into a metric space (Y, d Y ) is
More informationThe Ordered Covering Problem
The Ordered Covering Problem Uriel Feige Yael Hitron November 8, 2016 Abstract We introduce the Ordered Covering (OC) problem. The input is a finite set of n elements X, a color function c : X {0, 1} and
More informationTraveling 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
More informationNP-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
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 informationA Note on Vertex Arboricity of Toroidal Graphs without 7-Cycles 1
International Mathematical Forum, Vol. 11, 016, no. 14, 679-686 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.1988/imf.016.667 A Note on Vertex Arboricity of Toroidal Graphs without 7-Cycles 1 Haihui
More informationGreedy Approximations
CS 787: Advanced Algorithms Instructor: Dieter van Melkebeek Greedy Approximations Approximation algorithms give a solution to a problem in polynomial time, at most a given factor away from the correct
More informationAPPROXIMATION ALGORITHMS FOR A GRAPH-CUT PROBLEM WITH APPLICATIONS TO A CLUSTERING PROBLEM IN BIOINFORMATICS
APPROXIMATION ALGORITHMS FOR A GRAPH-CUT PROBLEM WITH APPLICATIONS TO A CLUSTERING PROBLEM IN BIOINFORMATICS SALIMUR RASHID CHOUDHURY Bachelor of Science, Islamic University of Technology, 2004 A Thesis
More informationIntroduction to Approximation Algorithms
Introduction to Approximation Algorithms Subir Kumar Ghosh School of Technology & Computer Science Tata Institute of Fundamental Research Mumbai 400005, India ghosh@tifr.res.in Overview 1. Background 2.
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 informationVertex Cover Approximations
CS124 Lecture 20 Heuristics can be useful in practice, but sometimes we would like to have guarantees. Approximation algorithms give guarantees. It is worth keeping in mind that sometimes approximation
More informationA Unified Approach to Approximating Partial Covering Problems
A Unified Approach to Approximating Partial Covering Problems Jochen Könemann 1, Ojas Parekh 2, and Danny Segev 3 1 Department of Combinatorics and Optimization, University of Waterloo, Canada. jochen@math.uwaterloo.ca
More informationCS 580: Algorithm Design and Analysis. Jeremiah Blocki Purdue University Spring 2018
CS 580: Algorithm Design and Analysis Jeremiah Blocki Purdue University Spring 2018 Chapter 11 Approximation Algorithms Slides by Kevin Wayne. Copyright @ 2005 Pearson-Addison Wesley. All rights reserved.
More informationThe Power of Local Optimization: Approximation Algorithms for Maximum-Leaf Spanning Tree
The Power of Local Optimization: Approximation Algorithms for Maximum-Leaf Spanning Tree Hsueh-I Lu R. Ravi y Brown University, Providence, RI 02912 Abstract Given an undirected graph G, finding a spanning
More informationApproximation Algorithms for Requirement Cut on Graphs
Algorithmica (2010) 56: 198 213 DOI 10.1007/s00453-008-9171-5 Approximation Algorithms for Requirement Cut on Graphs Viswanath Nagarajan R. Ravi Received: 2 June 2007 / Accepted: 11 January 2008 / Published
More informationCSC2420 Fall 2012: Algorithm Design, Analysis and Theory An introductory (i.e. foundational) level graduate course.
CSC2420 Fall 2012: Algorithm Design, Analysis and Theory An introductory (i.e. foundational) level graduate course. Allan Borodin November 8, 2012; Lecture 9 1 / 24 Brief Announcements 1 Game theory reading
More informationThe Full Survey on The Euclidean Steiner Tree Problem
The Full Survey on The Euclidean Steiner Tree Problem Shikun Liu Abstract The Steiner Tree Problem is a famous and long-studied problem in combinatorial optimization. However, the best heuristics algorithm
More informationOblivious Routing on Node-Capacitated and Directed Graphs
Oblivious Routing on Node-Capacitated and Directed Graphs Mohammad Thagi Hajiaghayi Robert D. Kleinberg Tom Leighton Harald Räcke Abstract Oblivious routing algorithms for general undirected networks were
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 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 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 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 informationMaximizing edge-ratio is NP-complete
Maximizing edge-ratio is NP-complete Steven D Noble, Pierre Hansen and Nenad Mladenović February 7, 01 Abstract Given a graph G and a bipartition of its vertices, the edge-ratio is the minimum for both
More informationCopyright 2000, Kevin Wayne 1
Guessing Game: NP-Complete? 1. LONGEST-PATH: Given a graph G = (V, E), does there exists a simple path of length at least k edges? YES. SHORTEST-PATH: Given a graph G = (V, E), does there exists a simple
More informationCOMP 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
More informationIntroduction to Algorithms / Algorithms I Lecturer: Michael Dinitz Topic: Approximation algorithms Date: 11/18/14
600.363 Introduction to Algorithms / 600.463 Algorithms I Lecturer: Michael Dinitz Topic: Approximation algorithms Date: 11/18/14 23.1 Introduction We spent last week proving that for certain problems,
More informationApproximation Algorithms
Approximation Algorithms Given an NP-hard problem, what should be done? Theory says you're unlikely to find a poly-time algorithm. Must sacrifice one of three desired features. Solve problem to optimality.
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 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 informationA 2k-Kernelization Algorithm for Vertex Cover Based on Crown Decomposition
A 2k-Kernelization Algorithm for Vertex Cover Based on Crown Decomposition Wenjun Li a, Binhai Zhu b, a Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation, Changsha
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 informationTreewidth and graph minors
Treewidth and graph minors Lectures 9 and 10, December 29, 2011, January 5, 2012 We shall touch upon the theory of Graph Minors by Robertson and Seymour. This theory gives a very general condition under
More information15-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
More informationA Preemptive Algorithm for Maximizing Disjoint Paths on Trees
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees Yossi Azar Uriel Feige Daniel Glasner October 15, 2008 Abstract We consider the online version of the maximum vertex disjoint path problem
More informationarxiv: v2 [cs.cc] 29 Mar 2010
On a variant of Monotone NAE-3SAT and the Triangle-Free Cut problem. arxiv:1003.3704v2 [cs.cc] 29 Mar 2010 Peiyush Jain, Microsoft Corporation. June 28, 2018 Abstract In this paper we define a restricted
More informationFlexible Coloring. Xiaozhou Li a, Atri Rudra b, Ram Swaminathan a. Abstract
Flexible Coloring Xiaozhou Li a, Atri Rudra b, Ram Swaminathan a a firstname.lastname@hp.com, HP Labs, 1501 Page Mill Road, Palo Alto, CA 94304 b atri@buffalo.edu, Computer Sc. & Engg. dept., SUNY Buffalo,
More informationImproved Results on Geometric Hitting Set Problems
Improved Results on Geometric Hitting Set Problems Nabil H. Mustafa nabil@lums.edu.pk Saurabh Ray saurabh@cs.uni-sb.de Abstract We consider the problem of computing minimum geometric hitting sets in which,
More information12 Introduction to LP-Duality
12 Introduction to LP-Duality A large fraction of the theory of approximation algorithms, as we know it today, is built around linear programming (LP). In Section 12.1 we will review some key concepts
More informationCS364A: Algorithmic Game Theory Lecture #19: Pure Nash Equilibria and PLS-Completeness
CS364A: Algorithmic Game Theory Lecture #19: Pure Nash Equilibria and PLS-Completeness Tim Roughgarden December 2, 2013 1 The Big Picture We now have an impressive list of tractability results polynomial-time
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 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 informationThe hierarchical model for load balancing on two machines
The hierarchical model for load balancing on two machines Orion Chassid Leah Epstein Abstract Following previous work, we consider the hierarchical load balancing model on two machines of possibly different
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 information1 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
More informationVertex Cover Approximations on Random Graphs.
Vertex Cover Approximations on Random Graphs. Eyjolfur Asgeirsson 1 and Cliff Stein 2 1 Reykjavik University, Reykjavik, Iceland. 2 Department of IEOR, Columbia University, New York, NY. Abstract. The
More information6. 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
More informationApproximation of satisfactory bisection problems
Approximation of satisfactory bisection problems Cristina Bazgan a,, Zsolt Tuza b, Daniel Vanderpooten a a LAMSADE, Université Paris-Dauphine, Place du Marechal de Lattre de Tassigny, 75775 Paris Cedex
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 informationKey words. graph algorithms, chromatic number, circular arc graphs, induced cycles
SIAM J. COMPUT. Vol. 0, No. 0, pp. 000 000 c XXXX Society for Industrial and Applied Mathematics REVISITING TUCKER S ALGORITHM TO COLOR CIRCULAR ARC GRAPHS MARIO VALENCIA-PABON Abstract. The circular arc
More informationStrongly 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
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 informationFall CS598CC: Approximation Algorithms. Chandra Chekuri
Fall 2006 CS598CC: Approximation Algorithms Chandra Chekuri Administrivia http://www.cs.uiuc.edu/homes/chekuri/teaching/fall2006/approx.htm Grading: 4 home works (60-70%), 1 take home final (30-40%) Mailing
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 informationCS 598CSC: Approximation Algorithms Lecture date: March 2, 2011 Instructor: Chandra Chekuri
CS 598CSC: Approximation Algorithms Lecture date: March, 011 Instructor: Chandra Chekuri Scribe: CC Local search is a powerful and widely used heuristic method (with various extensions). In this lecture
More informationPolynomial Time Approximation Schemes for the Euclidean Traveling Salesman Problem
PROJECT FOR CS388G: ALGORITHMS: TECHNIQUES/THEORY (FALL 2015) Polynomial Time Approximation Schemes for the Euclidean Traveling Salesman Problem Shanshan Wu Vatsal Shah October 20, 2015 Abstract In this
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 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 informationNotes for Lecture 24
U.C. Berkeley CS170: Intro to CS Theory Handout N24 Professor Luca Trevisan December 4, 2001 Notes for Lecture 24 1 Some NP-complete Numerical Problems 1.1 Subset Sum The Subset Sum problem is defined
More informationApproximation Algorithms
Chapter 8 Approximation Algorithms Algorithm Theory WS 2016/17 Fabian Kuhn Approximation Algorithms Optimization appears everywhere in computer science We have seen many examples, e.g.: scheduling jobs
More informationThe edge-disjoint paths problem is NP-complete for series parallel graphs
Discrete Applied Mathematics 115 (2001) 177 186 The edge-disjoint paths problem is NP-complete for series parallel graphs Takao Nishizeki a, Jens Vygen b;, Xiao Zhou c a Graduate School of Information
More informationJudicious bisections
Judicious bisections Po-Shen Loh Carnegie Mellon University Joint work with Choongbum Lee and Benny Sudakov Max Cut Problem Given a graph, find a bipartition which maximizes the number of crossing edges.
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 informationThe 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
More informationComplexity. Congestion Games. Algorithmic Game Theory. Alexander Skopalik Algorithmic Game Theory 2013 Congestion Games
Algorithmic Game Theory Complexity of pure Nash equilibria We investigate the complexity of finding Nash equilibria in different kinds of congestion games. Our study is restricted to congestion games with
More informationTheorem 2.9: nearest addition algorithm
There are severe limits on our ability to compute near-optimal tours It is NP-complete to decide whether a given undirected =(,)has a Hamiltonian cycle An approximation algorithm for the TSP can be used
More information