MINIMUM DIAMETER COVERING PROBLEMS. May 20, 1997
|
|
- Jayson Bishop
- 5 years ago
- Views:
Transcription
1 MINIMUM DIAMETER COVERING PROBLEMS Esther M. Arkin y and Refael Hassin z May 20, 1997 Abstract A set V and a collection of (possibly non-disjoint) subsets are given. Also given is a real matrix describing distances between elements of V. A cover is a subset of V containing at least one representative from each subset. The multiple-choice minimum diameter problem is to select a cover of minimum diameter. The diameter is dened as the maximum distance of any pair of elements in the cover. The multiple-choice dispersion problem, which is closely related, asks us to maximize the minimum distance between any pair of elements in the cover. The problems are NP-hard. We present polynomial time algorithms for approximating special cases and generalizations of these basic problems, and we prove in other cases that no such algorithms exist (assuming P 6= N P ). 1 Introduction This paper deals with a class of multiple-choice problems. We assume that a set V of elements is given, together with subsets S 1 ; :::; S m. A cover is a subset of V that contains at least one representative from each S j ; j = 1; :::; m. Our interest is in problems in which the objective is to select a cover whose elements are close to each other with respect to a given distance function. Our measure of proximity is the diameter of the set. The diameter is dened as the maximum distance of any pair of elements in the cover. Thus, the multiple-choice cover problem is to compute a cover of minimum diameter. An illustrative way to describe our basic problem is as follows: There are m rms (or government oces, or points in some statistical experiment), j = 1; :::; m and each can choose for its location a point from a given subset S j. The rms all wish to communicate with one another, and thus want to be close to each other. Specically, the objective is to minimize the maximum distance between rms. In a more general case, it is assumed that the cover can be further partitioned into a given number, k, of clusters, and our goal is to minimize the maximum diameter of a cluster. We call this problem the multiple-choice k-partition problem. When the cardinalities of the sets S j are bounded by a constant `, the problem becomes `-choice k-partition. In particular, the pair-choice problem, i.e., ` = 2, will be treated separately. The dispersion of a set is dened as the distance between the two closest elements in the set. We also consider the variation of the problem in which the goal is to maximize the dispersion of the cover. This may be the goal when the location of obnoxious facilities is considered (see for example, [20]). It turns out that these problems are much harder to approximate than the diamter problems. Several (single-choice) k-partition problems have been studied in the literature. The single-choice 2- partition problem, namely, nding a minimum diameter bipartition of a given set is polynomially solvable. It can be solved by searching on the distinct distance values, d, and for each test value considering only edges of length larger than d and testing for bipartition of the resulting graph (see [3], [16]). The 3-partition problem is NP-hard even in the plane [12] [5]. The one-dimensional k-partition problem, where the elements are points on a line, is however polynomially solvable [3]. Assuming that the distance matrix obeys the triangle inequality, a 2-approximation for the k-partition problem can be obtained in time O(jV jk) [5] (see [9] for a dierent method to obtain a 2-approximation). Assuming P 6= N P, a 2? approximation for the single-choice k-partition problem (when k is an input to the problem) cannot be obtained in polynomial time for any > 0 ([5], [9]). This is true even when the elements are points in the 3-dimensional Euclidean space [5]. In the plane, a better error bound may be possible, but in any case it cannot be better than p 3 [5]. y Department of Applied Mathematics and Statistics, SUNY Stony Brook, Stony Brook, NY estie@ams.sunysb.edu. Partially supported by NSF Grants ECSE and CCR z Department of Statistics and Operations Research, Tel-Aviv University, Tel-Aviv 69978, Israel. hassin@math.tau.ac.il. 1
2 Summary of results: The multiple-choice cover problem 1. The pair-choice cover problem of nding a vertex cover of minimum diameter is polynomially solvable (Theorem 2.2). 2. The triple-choice cover problem is NP-complete even when the sets are disjoint and represented by points in the plane (Theorem 2.4). 3. The triple-choice problem cannot be approximated with a constant error guarantee, assuming P 6= N P (Corollary 2.5). 4. Even if we assume the triangle inequality, no approximation of error guarantee of less than 2 is possible for the triple-choice cover problem (Corollary 2.6). 5. If we assume the triangle inequality then the multiple-choice cover problem can be approximated with a bound of 2 (Algorithm Multi Choice in Figure 2). 6. In the plane the error of the multile-choice cover problem can be bounded by 2= p 3 (Algorithm Plane Multi Choice in Figure 3). The pair-choice 2-partition problem 1. The pair-choice 2-partition problem is NP-hard when we allow the sets S j to be non-disjoint. This is also true when we assume the triangle inequality (Corollary 3.4). 2. The pair-choice 2-partition problem in the plane is polynomially solvable (Algorithm Plane Test in Figure 4). 3. Assuming P 6= N P, the pair-choice 2-partition problem cannot be approximated with a constant error guarantee (Corollary 3.5). 4. Even if we assume the triangle inequality, no approximation of error guarantee of less than 2 is possible for the pair-choice 2-partition problem (Corollary 3.4). The multiple-choice k-partition problem 1. If we assume the triangle inequality then the `-choice k-partition problem can be approximated with a bound of 2, for any xed ` and k (Remarks 3.8 and 3.9). 2. In the plane the multiple-choice 2-partition problem can be approximated within an error bound of 2= p 3 (Remark 3.10). The multiple-choice maximum dispersion problem 1. The pair-choice maximum dispersion problem of nding a vertex cover of maximum dispersion is polynomially solvable (Theorem 4.1). 2. The triple-choice maximum dispersion problem is NP-complete even when the sets are disjoint and represented by points in the plane (Theorem 4.3). 3. The triple-choice maximum dispersion problem cannot be approximated with a constant error guarantee, assuming P 6= N P, even when the elements are represented by points in the plane (Corollary 4.4). 4. The `-choice k-partition dispersion problem cannot be solved or approximated within a constant factor in polynomial time, even if ` = k = 2. 2
3 Several other multiple-choice problems have been studied in the literature. Gabow, Maheshwari, and Osterweil [7] proved that the following pair-choice problem is NP-complete: Given a directed acyclic graph with two distinguished vertices s; t, and a set of k pairs of vertices, determine whether there exists a path from s to t that uses at most one vertex from each of the given pairs. With the obvious modications, this proof can be used also for an equivalent result when the graph is undirected. Although their proof does not apply when the given pairs are disjoint; it is not hard to see that the problem remains NP-complete when the given pairs are disjoint (see [6]). Itai, Rodeh, and Tanimoto [11] proved that the following problem is NP-complete: Given a bipartite graph with k pairs of edges, nd whether there exists a perfect matching that uses at most one edge from each of the given subsets. Their proof does not apply when the given pairs are disjoint, however, the problem remains NP-complete for disjoint pairs, [6]. An important multiple-choice problem is the multiple-choice knapsack problem: A set of \items" is given, and each has a \cost" and a \value". The items are partitioned into classes. The goal is to select a subset that maximizes the total value subject to a budget constraint and so that at most one item is selected from each of the given classes. The problem is NP-hard but can be solved in pseudopolynomial time. Sinha and Zoltners [19] developed a Branch and Bound algorithm for it. (See [18] for more recent developments on this approach.) Lawler [14] presented a fully polynomial approximation scheme. Pair-choice problems that resemble ours but with a dierent objective functions are discussed by Arkin, Halldorson and Hassin [1]. The tree and tour cover problems on an edge-weighted graph are to compute a vertex cover whose vertices can be connected by a tree or a closed walk, respectively, of minimum total length. Both problems are NP-hard and constant factor approximation algorithms are described in [1]. Multiple choice p-center problems were studied by [10] who showed they are NP-complete. [8] gave polynomial approximation algorithms. 2 Multiple-choice cover of minimum diameter 2.1 The problem Let V = f1; : : :; ng be a given set. Also given is a symmetric real matrix D = (d ij ) 2 IR nn + dening the distances between pairs of elements of V. Let S 1 ; :::; S m V be given. A cover is a subset C V such that C \ S i 6= ; for all S i. A d-cover is a cover whose diameter, d(c) = maxfd ij : i; j 2 Cg, is at most d. Unless explicitly stated, we do not assume that D satises the triangle inequality, and thus, the diameter may dier from the longest \shortest path" in the set. In this section we observe the existence of a polynomial time algorithm for nding the minimum d for which a d-cover exists in the case where each set S i has cardinality two. A reduction from 3-SAT shows that the problem is NP-hard when the cardinality of the sets S i is three or more, and the distance matrix corresponds to the Euclidean distances between points in the plane. However, if the distances obey the triangle inequality, it is possible to approximate the minimum d and bound the error ratio by a constant in polynomial time. 2.2 Polynomial solution for pair-choice We now consider the case when each S i has cardinality 2. In this case, we can represent the sets S i using a graph G = (V; E), where V = f1; :::; ng is the set of elements, and, for every subset S i = fu; wg, we place an edge between element u and element w. The symmetric matrix D = (d ij ; i; j 2 V ) describes intervertex distances. A vertex cover is a subset C V such that C \ e 6= ; for all e 2 E. Problem 2.1 (Pair-Choice Cover Problem) Find a vertex cover of a minimum diameter. Theorem 2.2 Problem 2.1 can be solved in time O(n 2 log n). Proof: Algorithm Test in Figure 1 tests whether a particular value d is a feasible diameter by stating the problem as a 2-SAT problem. 2-SAT is the problem of nding whether there exists a truth assignment to the variables, such that a formula in conjunctive normal form, with at most two literals per clause, is satised. 3
4 Test input 1. A graph G = (V; E) with weights d ij i; j 2 V. 2. A value d 2 IR. returns 1. \TRUE" if G has a d-cover. 2. \FALSE" if G has no d-cover. begin Let x i be a variable for every i 2 V: for every (i; j) 2 E Dene a clause (x i _ x j ). for every i; j 2 V such that d ij > d Dene a clause (x i _ x j ). if the formula is satisable return \TRUE". else return \FALSE". end Test Figure 1: Algorithm Test The algorithm denes a variable, x i, for each vertex i 2 V, that is true if the vertex i is chosen and false otherwise. We now use a linear time algorithm that solves the 2-SAT problem, such as the one described by Even, Itai and Shamir [4] (linear in the number of clauses, which is O(n 2 ) in our case). To nd the optimal d we perform binary search on the values of D to nd the smallest value for which the test reply is \true". 2.3 NP-completeness of triple-choice We saw above how the pair-choice cover problem is related to 2-SAT. We now show that a 3-SAT problem can be written as a triple-choice cover problem, thus showing the triple-choice problem to be hard. Let V = f1; :::; ng be given with a symmetric real matrix D 2 IR nn + dening the distances between pairs of elements of V. Let S 1 ; :::; S m V be given. Problem 2.3 (Multiple-Choice Cover Problem) Find a subset C V, such that jc \ S i j 1 for i = 1; :::; m, and the diameter of C, d(c) = maxfd kl : k; l 2 Cg, is minimized. Theorem 2.4 Problem 2.3 is NP-hard even when S i i = 1; :::; m are disjoint, js i j 3 i = 1; :::; m, the elements of V are points in the plane, and D is the Euclidean distance matrix. Proof: The decision problem (does there exist a d-cover, for some constant d) is obviously in NP. We prove the theorem by a reduction from 3-satisability. Given a set of clauses K j = x j _ y j _ z j (j = 1; :::; `) where fx j ; y j ; z j g fu 1 ; u 1 ; : : : ; u n ; u n g. we consider a circle of diameter d 0 : For each variable, we place one point corresponding to the variable and one point corresponding to its negation diameterically opposite on the circle. That is, the distance between these points is d 0. We choose d 0 > d suciently close to d so that the distance between any two points which correspond to dierent variables is less than d. We dene an instance of Problem 2.3 with sets S 1 ; :::; S n such that S i consists of the points associated with u i and u i, and sets S n+1 ; :::; S n+` such that S n+j consists of the triplet of points whose locations coincide with those of x j ; y j ; z j. A feasible solution with diameter at most d is any set of points such that: 1. From each pair of points corresponding to u j ; u j, exactly one is selected. 2. From each triplet of points corresponding to x j ; y j ; z j, at least one is selected. 4
5 Thus, if there exists a subset of diameter at most d then there exists a satisfying assignment for K 1 ^ ^ K`. On the other hand, a satisfying assignment clearly determines a feasible set of diameter at most d. Thus the proof is complete. Note that in our proof the sets S i are not disjoint. However, it is easy to modify our construction to obtain disjoint sets by distinguishing among the points corresponding to dierent sets even when the above construction puts them at the same location. This is done by generating points that are very close to each other instead of a single point that appears in several sets S i. Corollary 2.5 Assuming P 6= N P, no polynomial approximation to Problem 2.3 with a bounded error guarantee exists. Proof: Suppose that a polynomial algorithm that guarantees a solution of diameter at most r times the optimal diameter exists. Consider the instance used in the proof of Theorem 2.4, except that whenever the distance between two points was d 0 we change it to rd 0, and all other distances are d. Now, the solutions associated with a satisfying assignment are of distance exactly d, while all other feasible solutions to the choice problem have diameter rd 0 > rd. Thus, the algorithm nds a satisfying assignment if one exists, in polynomial time. Note that in the construction used in the proof of Corollary 2.5, the triangle inequality does not hold. In the next section we show how to nd approximations when the triangle inequality is known to hold. However we have the following: Corollary 2.6 Assuming P 6= N P, no polynomial approximation to Problem 2.3 with an error guarantee of less than two exists, even when the triangle inequality is known to hold. Proof: We can use the same proof as before but modify the distances: The distance between two points that were oppositely located on the circle is dened to be 2 while every other distance between any other pair of points is dened to be 1. The triangle inequality holds and there exists a satisable assignment if and only if the solution to this instance of Problem 2.3 is 1. Otherwise, the solution is 2. Hence, an approximation algorithm which is guaranteed to produced a solution at most times the optimal, for < 2 must output a solution of diameter 1 when one exists. Such an algorithm can be used to solve the 3-satisability problem. Hence, if P 6= N P, it cannot be polynomial. 2.4 Approximation assuming the triangle inequality We now present a bounded error approximation for Problem 2.3 under the assumption that the distances satisfy the triangle inequality. Let S q be a set of minimum cardinality. For each element of i 2 S q, we nd the closest element in every other set S p, p 6= q, and let this distance be d ip. We get an approximate solution containing i, and P points that are at distance at most d i = maxfd ip j p 6= qg. m Denote N = j=1 js jj. Theorem 2.7 Algorithm Multi Choice nds a cover of diameter at most twice the optimum. Its running time is O(jS q jn). Proof: Consider a choice of i 2 S q such that d = d i. The algorithm nds a cover containing elements, all of which are at distance at most d from i. Consider any two sets, and the elements in them minimizing the distance to i, say j and k. By the triangle inequality, the interdistances between j; k satisfy d j;k d i;j + d i;k 2d so we have a 2d-cover. Clearly a cover that contains i must have a diameter of at least d i. Since a cover must contain a representative from S q, the minimum possible diameter of a cover is at least d = minfd i j i 2 S q g. Therefore, the cover C of diameter at most 2d which was found by the algorithm is a 2-approximation. The algorithm executes js q j iterations and each iteration scans all the elements in V n S q. Hence the time complexity is O(jS q jn). In the rest of this section we describe another polynomial approximation algorithm, which applies to geometric problems in the plane. While this algorithm compares favorably with the previous one for this case, guaranteeing an error ratio of at most 2= p 3 ( approximately 1.15), its complexity is O(n 3 N). Theorem 2.8 Algorithm Plane Multi Choice computes a cover whose diameter is at most 2= p 3 times the minimum diameter of a feasible solution, and this bound is tight, for this algorithm. The algorithm can be executed in time O(n 3 N). 5
6 Multi Choice input 1. A set V = f1; : : :; ng and subsets S 1 ; :::; S m V. 2. A symmetric matrix D = (d ij ) 2 IR nn + satisfying the triangle inequality. returns 1. A cover C of S 1 ; :::; S m of diameter at most 2d. begin Find q such that js q j = minfjs j j : j = 1; : : : ; mg. for every i 2 S q ( Compute d i, a 2-approximation for a minimum diameter cover containing i). d ip := minfd ij j j 2 S p g for p 6= q d i := maxfd ip j 1 p m; p 6= q g Find i 2 S q such that d i = min i fd i g. return d := d i, C := fi g [ fj j d i j dg. end Multi Choice Figure 2: Algorithm Multi Choice Plane Multi Choice Compute a disk B of minimum diameter that contains at least one point from each subset S 1 ; :::; S m. return V \ B. end Plane Multi Choice Figure 3: Algorithm Plane Multi Choice Proof: The smallest disk covering all sets is determined by two or three points which lie on its boundary. In the case of two points the diameters of the disk and the points are equal. Consider the case of three points. In this case, the convex hull of these points contains the center of the disk. If the triangle they form is not equilateral then we can shorten its longest edge by moving one of these points on the boundary of the disk. This change preserves the diameter of the disk while decreasing the diameter of the triangle. Hence, this change increases the ratio of the diameter of the smallest disk to the diameter of a feasible solution. We conclude that this ratio is maximized on an equilateral triangle, which yields the claimed bound. To nd a disk of minimum diameter one may simply check the feasibility of each of the O(n 3 ) disks dened by pairs and triplets of points of V and then choose the feasible one with the minimum diameter. This can easily be done in O(n 3 N) time. We close this section by pointing to a dierence in diculty between two problems that seem similar on the surface, namely that of nding the diameter, or the minimum radius disk covering the sets. For the single-choice (i.e., no-choice) problem, the minimum diameter of a set of n points in the plane can be found in O(n log n) time, and in fact also requires time (n log n) [17]. In contrast, nding the smallest radius disk covering n points in the plane can be done in linear time by Megiddo's algorithm [15]. In the multiple-choice problems we are considering, the contrast is even greater. The diameter problem is NP-hard (Theorem 2.4), while the smallest disk problem is polynomial. This dierence can be attributed to the fact that a constant number of points (3) determine the smallest disk, and thus simply examining all triples yields a polynomial time algorithm. 3 Multiple-choice 2-partition 3.1 The problem Let V = f1; :::; ng be given with a symmetric real matrix D 2 IR nn + dening the distances between pairs of elements of V. Let S 1 ; :::; S m V be given. A 2-partition of a set C consists of two disjoint subsets 6
7 C 1 ; C 2 such that C 1 [ C 2 = C. Consider a 2-partition C 1 ; C 2 of a cover C. We dene its diameter to be max`=1;2 maxfd ij : i; j 2 C`g. The problem we consider in this section is: Find a cover C and a 2-partition of C of minimum diameter. Clearly, this problem is harder than the minimum diameter cover discussed in the previous section, and therefore, we conclude that the problem is NP-hard even when the sets S i are disjoint, js i j 3, the elements of V are points in the plane, and D is the Euclidean distance matrix. In the next section we show that even the cases that were easy for the minimum diameter problem, namely when the sets S i have cardinality at most two, are NP-hard (except for the pair-choice problem in the plane). Approximation algorithms are discussed in Section 3.4 (see also Remarks 3.8 and 3.10). 3.2 The pair-choice problem Given are a graph G = (V; E) with V = f1; : : :; ng and a symmetric matrix D = (d ij ; i; j 2 V ) describing distances. Problem 3.1 (pair-choice 2-partition problem) Find a vertex cover C and a 2-partition of C, so that the diameter of the partition is minimized. To solve Problem 3.1, one could search on the distinct values of the set fd ij : i; j 2 V g. For a given test value d let G d = (V; E d ) be a graph with the edge set E d = f(i; j) : d ij dg. The test amounts to solving the following problem, which we show to be NP-hard: Problem 3.2 (pair-choice induced subgraph problem) Given graphs G = (V; E) and G d = (V; E d ), nd whether there exists a vertex cover C V of G such that the subgraph of G d induced by C is bipartite. Problem 3.2 is (polynomially) equivalent to Problem 3.1. Clearly, an algorithm for Problem 3.1 can be used to solve Problem 3.2. Suppose that the answer to Problem 3.2 is positive. Let P 1 ; P 2 be the two parts of the induced subgraph. Then P 1 [ P 2 = C and d ij d for all i; j 2 P l l = 1; 2. Thus the outcome of the test is positive and the optimal solution value d to Problem 3.1 satises d d. On the other hand, if the answer is negative then d > d. However, we have the following negative result: Theorem 3.3 Problem 3.2 is NP-complete. Proof: The problem is obviously in NP. We prove the theorem by reduction from 3-satisability. Consider a given set of clauses K j = (x j _ y j _ z j ) where fx j ; y j ; z j g fu 1 ; u 1 ; ; u n ; u n g j = 1; : : : ; `. We dene G = (V; E) and G d = (V; E d ) as follows: V has 3` vertices corresponding to the negations of the literals of K 1 ; :::; K`. E d consists of the edges (x j ; y j ); (x j ; z j ); (y j ; z j ) j = 1; :::; `. We then dene edges fq; pg 2 E in G for each pair of vertices of V whenever p and q correspond to a variable and its negation. Clearly this construction takes polynomial time. We now show that the formula is satisfyable if and only if there exists a vertex cover of G such that the subgraph it induces in G d is bipartite. A vertex cover must include either all vertices corresponding to v i or all the vertices corresponding to v i. This is the case because if some vertex v i is not chosen, all vertices corresponding to v i must be chosen, since there are edges between v i and all these latter vertices which must be covered. We note that it may happen that the vertex cover will include, for example, all the vertices corresponding to i and some or all of the vertices corresponding to i. The latter may then be deleted to form a new vertex cover (which clearly induces a bipartite graph in G d ) corresponding to a satisfying assignment for the 3-satisability problem. Set a literal to be true if the corresponding vertex is chosen to be part of the vertex cover. For the chosen induced graph to be bipartite, at least one vertex from each triangle in G d must be left out of the vertex cover. In other words, each clause must be satised, since the negation of at least one of its literals is false. The way E is dened guarantees that for each variable i, either all the vertices corresponding to i or all the vertices corresponding to i will be chosen. This is the case since otherwise there will be an edge in E between a vertex i and a vertex i that is not covered if neither i nor i are in the vertex cover. Conversely, such a satisfying assignment can be used to form a vertex cover that induces a bipartite subgraph in G d. Corollary 3.4 Problem 3.1 is NP-hard even when the distances d ij satisfy the triangle inequality. Furthermore, assuming P 6= N P, no polynomial approximation to Problem 3.1 with an error guarantee of less than 2 exists even when the triangle inequality holds. 7
8 Proof: An instance of Problem 3.2 can be generated from instances of Problem 3.1 that satisfy the triangle inequality. To show this we simply set the lengths of edges of G d obtained in the proof above to be 1, and all other intervertex distances to be 2. Furthermore, for this instance, there is a satisable assignment to the formula if and only if the solution to Problem 3.1 is 1, otherwise the solution is 2. Thus a solution that approximates the optimal solution with error less than 2, must be optimal. Note that if the distances are obtained as the Euclidean distances of points in the plane, the above proof fails. In fact, we show in the next section, that the geometric version of the problem is polynomially solvable. Corollary 3.5 Assuming P 6= N P, no polynomial approximation to Problem 3.1 with a bounded error exists. Proof: Suppose such an approximation with a bound r on the error ratio exists. Given an instance of 3-satisability, we construct the (undirected) graph G corresponding to it as described above. We then dene a distance matrix on its vertices; d ij = 1 if (i; j) is in G d ; d ij = r + 1 otherwise. There is a satisable assignment if and only if the solution to Problem 3.2 on this graph is 1, otherwise the solution is r + 1. Thus the approximation solution to Problem 3.1 must be optimal. 3.3 Pair-Choice 2-partition in the plane The single-choice 2-partition problem asks for a partition of a set of points such that the maximum of the diameters of the two parts is minimized. When the points lie in the plane and d ij is the Euclidean distance between i and j, it is well known and easy to verify that there exists an optimal 2-partition that is separable, i.e., a partition such that the convex hulls of its parts are disjoint (see for example, [3], [16]). In other words, the two parts can be separated by a line. Thus only O(n 2 ) partitions (the ones generated by lines connecting pairs of points) must be considered. In the pair-choice problem, we make the following observation: The separability property holds with respect to the points chosen to participate in the cover. The reason is that once these points are selected, the best way to partition them denes a single-choice 2-partition problem. In some cases the number of partitions to be examined can be further reduced as shown in [2]. The idea there is that for any xed, the maximum of the two diameters associated with the partitions generated by the lines y = + x is unimodal in. Hence the optimal partition within this set of partitions can be computed by applying binary search. However, in the pair-choice version this unimodality property does not hold. The method above cannot be extended to partition a set of points in the plane into 3 sets, minimizing the maximum diameter, since it is no longer true that the convex hulls of the parts are necessarily disjoint. In fact, the problem of (single-choice) 3-partitioning of a set of points in the plane is NP-hard [12, page 185] (see also [5].) We use the separability property to solve Problem 3.1. In Algorithm Plane Test (Figure 4), we describe how to test a given value. The complete algorithm consists of a binary search on the distinct values of D. Theorem 3.6 The pair-choice 2-partition problem in the plane can be solved in time O(n 4 log n). Proof: Algorithm Plane Test tests a given d value by checking O(n 2 ) partitions, checking each partition in O(n 2 ) time. Using binary search on the values of D requires O(log n) tests. 3.4 Approximation assuming the triangle inequality We now show how to obtain a bounded error approximation for Problem 3.1 under the assumption that the distances satisfy the triangle inequality. Theorem 3.7 If D satises the triangle inequality then the pair-choice 2-partition problem can be approximated within a factor of 2 in time O(n 2 log n). Proof: Algorithm 2 Part Test tests for a given value d whether a 2-partition of diameter at most 2d exists, or no partition with diameter d or smaller exists. To do so we select an arbitrary edge e = (v; w) 2 E that must be covered, and check for both endpoints of e whether a cover containing the endpoint exists. Let u be 8
9 Plane Test input 1. A graph G = (V; E) where V is a set of points in the plane and d ij is the Euclidean distance between i; j 2 V. 2. A value d 2 IR. returns 1. \TRUE" if G has a d-cover. 2. \FALSE" if G has no d-cover. begin for every separable 2-partition (V 1 ; V 2 ) for every (i; j) 2 E Dene a clause (x i _ x j ). for every i; j 2 V 1 such that d ij > d Dene a clause (x i _ x j ). for every i; j 2 V 2 such that d ij > d Dene a clause (x i _ x j ). if the formula is satisfyable return \TRUE". return \FALSE". end Plane Test Figure 4: Algorithm Plane Test 2 Part Test begin Let (v; w) = e 2 E for every u 2 fv; wg (Suppose u 2 C) Let C 1 = fug [ fv 2 V jd uv dg. Let E 0 = f(i; j) 2 Eji; j =2 C 1 g: Let G 0 be the graph induced by E 0. A u :=Test(G 0 ; d). if either A v =\TRUE" or A w =\TRUE" return \TRUE". else return \FALSE". end 2 Part Test Figure 5: Algorithm 2 Part Test 9
10 one of the endpoints of e. Given d, we assume that u 2 C. Let C 1 be the set of all nodes at distance at most d from u. The diameter of C 1 is, by the triangle inequality, at most 2d. Every pair i; j such that (i; j) 2 E and both i and j are not in C 1 must be represented in C 2. Let V 0 be this set of nodes. Apply Algorithm Test (given in Figure 1) which tests a value d for a pair-choice cover to these pairs in V 0 (see Theorem 2.2). If diameter d suces to cover the remaining pairs, we clearly obtain a 2-partition with diameter at most 2d (C 1 has diameter at most 2d and C 2 has diameter at most d). Otherwise, we claim that no 2-partition cover of diameter d containing u can exist: Such a partition would contain u and a subset of C 1 and hence the other part of the cover would have to cover a set including all of V 0 with a diameter of d. This, however, is clearly impossible. The complexity of this algorithm is log n times the complexity of Test, O(n 2 log n). Remark 3.8 A similar procedure applies for the multiple-choice problem where js i j ` i = 1; : : :; m, that is, for the multiple-choice 2-partition problem. Instead of the algorithm that tests a value d for V 0 we use the approximate algorithm Multi Choice, which nds a cover for the subsets S i which are not covered by C 1 of diameter d apx, such that d apx is bounded by twice the minimum diameter of a cover of these subsets. If d apx 2d, a 2-partition cover of diameter 2d was found. On the other hand, if d apx > 2d we have that a minimum diameter of a cover for the subsets which were not covered by C 1 is strictly greater than d, and by a similar argument to the one in the previous theorem, a 2-partition cover of diameter d cannot exist. The same error bound of 2 is obtained and the complexity of Algorithm Multi Choice is multiplied by ` log n, for a total running time of O(`2N log n). Remark 3.9 For the multi-choice k-partition problem when the distances obey the triangle inequality, the following test procedure gives a 2-approximation: For every u 2 S 1 repeat the following steps: Suppose u is in the cover. Let C 1 = fug [ fv 2 V jd uv dg. Select an uncovered set and for each element, j, of this set, repeat the following steps. Set C 2 = fjg [ fv =2 C 1 jd jv dg. Continue the procedure in this way, forming C 3 ; : : : ; C k. If for any of the choices, C 1 ; : : : ; C k cover all of the subsets then this is a k-partition 2d-cover. Otherwise, no k-partition d-cover exists. The complexity will be O(`kN) per test value. The result is again a 2-approximation. Remark 3.10 In the plane we approximate the multi-choice problem as follows: We compute for each separable partition (V 1 ; V 2 ) and each pair of sets T V 1, or, T V 2 such that jt j 2 f2; 3g the smallest covering disk. Then, for each pair of such disks we check feasibility of the cover they dene and select the feasible solution with the smallest maximum diameter as our solution. The error ratio is bounded by 2= p 3 as in Algorithm Plane Multi Choice. The complexity of the algorithm is O(n 6 N) since we test pairs of disks from O(n 3 ) candidates. 4 Multiple-choice cover of maximum dispersion In this section we discuss problems in which the data is as before, but the objective function is reversed: Let V = f1; : : :; ng be a given set. Also given is a symmetric real matrix D = (d ij ) 2 IR nn + dening the distances between pairs of elements of V. Let S 1 ; :::; S m V be given. A d-max-cover is a cover whose dispersion, ^d(c) = minfd ij : i; j 2 Cg, is at least d. In this section we show the existence of a polynomial time algorithm for nding the maximum d for which a d-max-cover exists in the case where each set S i has cardinality two. A reduction from 3-SAT shows that the problem is NP-hard when the cardinality of the sets S i is larger than two, even when this cardinality is three, and the distance matrix corresponds to the Euclidean distances between points in the plane. Furthermore, (even when the distances obey the triangle inequality) it is not possible to approximate the maximum d and bound the error ratio by a constant in polynomial time, unless P = N P. As in the diameter problems, when the cardinalities of the sets S i are two, we represent them by a graph G = (V; E). Theorem 4.1 The problem of nding the maximum d for which a d-max-cover exists can be solved in time O(n 2 log n), if all sets S i have cardinality two. Proof: We modify algorithm Test in Figure 1 to test whether a particular value d is a feasible dispersion. As before, for any edge (i; j) 2 E we have a clause (x i _ x j ). The other clauses are dened dierently. For 10
11 any pair of vertices k and l whose distance from each other is smaller than d, we know that we can choose at most one of the vertices, so we have clauses of the form, (x k _ x l ). Next, we show that a 3-SAT problem can be written as a triple-choice cover problem, thus showing the triple-choice dispersion problem to be hard. Problem 4.2 (Multiple-Choice Dispersion Cover Problem) Find a subset C V, such that jc \ S i j 1 for i = 1; :::; m, and the dispersion of C, ^d(c) = minfd kl : k; l 2 Cg, is maximized. Theorem 4.3 Problem 4.2 is NP-hard even when S i i = 1; :::; m are disjoint, js i j 3 i = 1; :::; m, the elements of V are points in the plane, and D is the Euclidean distance matrix. Proof: The decision problem (does there exist a d-max-cover, for some constant d) is obviously in NP. We prove the theorem by a reduction from 3-satisability. Given a set of clauses K j = x j _ y j _ z j (j = 1; :::; `) where fx j ; y j ; z j g fu 1 ; u 1 ; ; u n ; u n g, we represent each variable u i by 2 points at distance d 0 < d from each other. Each such pair of points is placed at distance greater than d from other pairs. We dene an instance of Problem 4.2 with sets S 1 ; :::; S n such that S i consists of the points associated with u i and u i, and sets S n+1 ; :::; S n+` such that S n+j consists of the triplet of points whose location coincides with these of x j ; y j ; z j. A feasible solution with dispersion at least d is any set of points such that: 1. From each pair of points corresponding to u j ; u j, exactly one is selected. 2. From each triplet of points corresponding to x j ; y j ; z j, at least one is selected. Thus, if there exists a subset of dispersion at least d then there exists a satisfying assignment for K 1 ^ ^ K`. On the other hand, a satisfying assignment clearly determines a feasible set of dispersion at least d. Thus the proof is complete. Corollary 4.4 Assuming P 6= N P, no polynomial approximation to Problem 4.2 with a bounded error guarantee exists, even for instances of the problem corresponding to points in the plane. Proof: Suppose that a polynomial algorithm that guarantees a solution of diameter at most r times the optimal diameter exists. Consider the instance used in the proof of Theorem 4.3, except that whenever the distance between two points was d 0 we change it to (1=r)d 0, and all other distances are d or greater. Now, the solutions associated with a satisfying assignment are of dispersion d or greater, while all other feasible solutions to the choice problem have dispersion (1=r)d 0 < (1=r)d. Thus, the algorithm nds a satisfying assignment if one exists, in polynomial time. Finally, we mention that the corresponding partition problems of max-min dispersion cannot be solved or approximated in polynomial time. The proofs are similar to those of Theorems 4.3 and 3.2, and Corollary 4.4, and are omitted. The only problem solvable in polynomial time for the min-max diameter was Problem 3.1 (pair-choice 2-partition) in the plane. However, this relied on the property that such a partition is separable by a line, a property that is clearly not true for the dispersion problem. The complexity of the pair-choice 2-partition maximum dispersion in the plane remains open. 5 Open Problems An interesting open question is whether a more ecient algorithm exists for Problem 2.1 in the geometric case where the input of size O(n) consists of the locations of n points in the plane and D is the Euclidean distance matrix. Several of the other algorithms that are polynomial have rather high worst case running times. Can these be improved? In particular Algorithm Plane Test whose running time is O(n 4 log n) seems improvable. The proof of Theorem 3.3 denes a pair-choice problem where the pairs (edges of G) are not disjoint. The question of whether the restricted problem where the pairs are disjoint can be solved polynomially, is open. Finally, the complexity of the pair-choice 2-partition maximum dispersion in the plane is open. 11
12 References [1] E. M. Arkin, M.M. Halldorson and R. Hassin, \Approximating the tree and tour covers of a graph", Information Processing Letters 47, , [2] M. Benelli and R. Hassin, \Optimal separable partitioning in the plane" Discrete Applied Mathematics, [3] P. Brucker, \On the complexity of clustering problems", in: R. Henn, B. Korte and W. Oettli, eds., Optimization and Operations Research, Lecture Notes in Economics and Mathematical Systems 157, Springer, [4] S. Even, A. Itai, and A. Shamir, \On the complexity of timetable and multicommodity ow problems", SIAM J. Comput. 5, , [5] T. Gonzalez, \Clustering to minimize the maximum intercluster distance", Theoretical Computer Science 38, , [6] M. R. Garey, and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP- Completeness, Freeman, [7] H. N. Gabow, S. N. Maheshwari, and L. J. Osterweil, \On two problems in the generation of program test paths", IEEE Transactions on Software Engineering SE-2, , [8] D. Hochbaum and A. Pathria \Generalized p-center problems: Complexity results and approximation algorithms", to appear European Journal of Operational Research. [9] D. Hochbaum and D. Shmoys, \A unied approach to approximation algorithms for bottleneck problems", J. of the Association for Computing Machinery 33, , [10] O. Hudec, \On alternative p-center problems", ZOR - Mthods and Models of Operations Research 36, , [11] A. Itai, M. Rodeh, and S.L. Tanimoto, \Some matching problems for bipartite graphs", J. of ACM 25, , [12] D.S. Johnson, \The NP-completeness column: an ungoing guide", J. of Algorithms, 3, , [13] D.S. Johnson and C.H. Papadimitriou, \Performance guarantees for heuristics", Ch. 5 in The Traveling Salesman Problem, (E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, Eds.), Wiley & Sons, [14] E. L. Lawler, \Fast approximation algorithms for knapsack problems", Math. of Op. Res 4, , [15] N. Megiddo, \Linear-time algorithms for linear programming in IR 3 ", SIAM J. Computing 12, , [16] C. Monma and S. Suri, \Partitioning points and graphs to minimize the maximum or the sum of diameters" Proceedings of the Sixth International Conference on the Theory and Applications of Graphs, John Wiley & Sones, [17] F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, [18] S. Sarin and M.H. Karwan, \The linear multiple-choice knapsack problem", Operations Research Letters 8, , [19] P. Sinha and A.A Zoltners, \The multiple-choice knapsack problem", Operations Research 27, , [20] A. Tamir, \Obnoxious facility location on graphs", SIAM J. Discrete Mathematics 4, ,
IBM Almaden Research Center, 650 Harry Road, School of Mathematical Sciences, Tel Aviv University, TelAviv, Israel
On the Complexity of Some Geometric Problems in Unbounded Dimension NIMROD MEGIDDO IBM Almaden Research Center, 650 Harry Road, San Jose, California 95120-6099, and School of Mathematical Sciences, Tel
More informationApproximation Algorithms for Maximum. Coverage and Max Cut with Given Sizes of. Parts? A. A. Ageev and M. I. Sviridenko
Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts? A. A. Ageev and M. I. Sviridenko Sobolev Institute of Mathematics pr. Koptyuga 4, 630090, Novosibirsk, Russia fageev,svirg@math.nsc.ru
More information2 Notation and Preliminaries
On Asymmetric TSP: Transformation to Symmetric TSP and Performance Bound Ratnesh Kumar Haomin Li epartment of Electrical Engineering University of Kentucky Lexington, KY 40506-0046 Abstract We show that
More informationLecture 14 - P v.s. NP 1
CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanford.edu) February 27, 2018 Lecture 14 - P v.s. NP 1 In this lecture we start Unit 3 on NP-hardness and approximation
More informationLecture 15 - NP Completeness 1
CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanford.edu) February 29, 2018 Lecture 15 - NP Completeness 1 In the last lecture we discussed how to provide
More informationAbstract. This paper discusses polynomial-time reductions from Hamiltonian Circuit (HC),
SAT-Variable Complexity of Hard Combinatorial Problems Kazuo Iwama and Shuichi Miyazaki Department of Computer Science and Communication Engineering Kyushu University, Hakozaki, Higashi-ku, Fukuoka 812,
More informationCluster Graph Modification Problems
Cluster Graph Modification Problems Ron Shamir Roded Sharan Dekel Tsur December 2002 Abstract In a clustering problem one has to partition a set of elements into homogeneous and well-separated subsets.
More informationNP and Computational Intractability
NP and Computational Intractability 1 Polynomial-Time Reduction Desiderata'. Suppose we could solve X in polynomial-time. What else could we solve in polynomial time? don't confuse with reduces from Reduction.
More informationThe Complexity of Maximum. Matroid-Greedoid Intersection and. Weighted Greedoid Maximization
Department of Computer Science Series of Publications C Report C-2004-2 The Complexity of Maximum Matroid-Greedoid Intersection and Weighted Greedoid Maximization Taneli Mielikäinen Esko Ukkonen University
More informationAn approximation algorithm for the minimum latency set cover problem
An approximation algorithm for the minimum latency set cover problem Refael Hassin 1 and Asaf Levin 2 1 Department of Statistics and Operations Research, Tel-Aviv University, Tel-Aviv, Israel. hassin@post.tau.ac.il
More informationAlgorithms: COMP3121/3821/9101/9801
NEW SOUTH WALES Algorithms: COMP3121/3821/9101/9801 Aleks Ignjatović School of Computer Science and Engineering University of New South Wales LECTURE 9: INTRACTABILITY COMP3121/3821/9101/9801 1 / 29 Feasibility
More informationMulti-criteria approximation schemes for the resource constrained shortest path problem
Noname manuscript No. (will be inserted by the editor) Multi-criteria approximation schemes for the resource constrained shortest path problem Markó Horváth Tamás Kis Received: date / Accepted: date Abstract
More informationWeek Cuts, Branch & Bound, and Lagrangean Relaxation
Week 11 1 Integer Linear Programming This week we will discuss solution methods for solving integer linear programming problems. I will skip the part on complexity theory, Section 11.8, although this is
More information8.5 Sequencing Problems
8.5 Sequencing Problems Basic genres. Packing problems: SET-PACKING, INDEPENDENT SET. Covering problems: SET-COVER, VERTEX-COVER. Constraint satisfaction problems: SAT, 3-SAT. Sequencing problems: HAMILTONIAN-CYCLE,
More informationOn-line Bin-Stretching. Yossi Azar y Oded Regev z. Abstract. We are given a sequence of items that can be packed into m unit size bins.
On-line Bin-Stretching Yossi Azar y Oded Regev z Abstract We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try
More informationComplexity analysis of job-shop scheduling with deteriorating jobs
Discrete Applied Mathematics 117 (2002) 195 209 Complexity analysis of job-shop scheduling with deteriorating jobs Gur Mosheiov School of Business Administration and Department of Statistics, The Hebrew
More informationDiscrete Optimization 2010 Lecture 10 P, N P, and N PCompleteness
Discrete Optimization 2010 Lecture 10 P, N P, and N PCompleteness Marc Uetz University of Twente m.uetz@utwente.nl Lecture 9: sheet 1 / 31 Marc Uetz Discrete Optimization Outline 1 N P and co-n P 2 N P-completeness
More informationChapter 11. Approximation Algorithms. Slides by Kevin Wayne Pearson-Addison Wesley. All rights reserved.
Chapter 11 Approximation Algorithms Slides by Kevin Wayne. Copyright @ 2005 Pearson-Addison Wesley. All rights reserved. 1 Approximation Algorithms Q. Suppose I need to solve an NP-hard problem. What should
More informationNP-Completeness. Andreas Klappenecker. [based on slides by Prof. Welch]
NP-Completeness Andreas Klappenecker [based on slides by Prof. Welch] 1 Prelude: Informal Discussion (Incidentally, we will never get very formal in this course) 2 Polynomial Time Algorithms Most of the
More informationStructural Grobner Basis. Bernd Sturmfels and Markus Wiegelmann TR May Department of Mathematics, UC Berkeley.
I 1947 Center St. Suite 600 Berkeley, California 94704-1198 (510) 643-9153 FAX (510) 643-7684 INTERNATIONAL COMPUTER SCIENCE INSTITUTE Structural Grobner Basis Detection Bernd Sturmfels and Markus Wiegelmann
More informationNP-COMPLETE PROBLEMS. 1. Characterizing NP. Proof
T-79.5103 / Autumn 2006 NP-complete problems 1 NP-COMPLETE PROBLEMS Characterizing NP Variants of satisfiability Graph-theoretic problems Coloring problems Sets and numbers Pseudopolynomial algorithms
More informationThe minimum G c cut problem
The minimum G c cut problem Abstract In this paper we define and study the G c -cut problem. Given a complete undirected graph G = (V ; E) with V = n, edge weighted by w(v i, v j ) 0 and an undirected
More informationDifferential approximation results for the Steiner tree problem
Differential approximation results for the Steiner tree problem Marc Demange, Jérôme Monnot, Vangelis Paschos To cite this version: Marc Demange, Jérôme Monnot, Vangelis Paschos. Differential approximation
More informationLimitations of Algorithm Power
Limitations of Algorithm Power Objectives We now move into the third and final major theme for this course. 1. Tools for analyzing algorithms. 2. Design strategies for designing algorithms. 3. Identifying
More informationAn 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts
An 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts Alexander Ageev Refael Hassin Maxim Sviridenko Abstract Given a directed graph G and an edge weight function w : E(G) R +, themaximumdirectedcutproblem(max
More informationON THE COMPLEXITY OF SOLVING THE GENERALIZED SET PACKING PROBLEM APPROXIMATELY. Nimrod Megiddoy
ON THE COMPLEXITY OF SOLVING THE GENERALIZED SET PACKING PROBLEM APPROXIMATELY Nimrod Megiddoy Abstract. The generalized set packing problem (GSP ) is as follows. Given a family F of subsets of M = f mg
More informationCoins with arbitrary weights. Abstract. Given a set of m coins out of a collection of coins of k unknown distinct weights, we wish to
Coins with arbitrary weights Noga Alon Dmitry N. Kozlov y Abstract Given a set of m coins out of a collection of coins of k unknown distinct weights, we wish to decide if all the m given coins have the
More informationRestricted b-matchings in degree-bounded graphs
Egerváry Research Group on Combinatorial Optimization Technical reports TR-009-1. Published by the Egerváry Research Group, Pázmány P. sétány 1/C, H1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.
More informationNP-Completeness. NP-Completeness 1
NP-Completeness Reference: Computers and Intractability: A Guide to the Theory of NP-Completeness by Garey and Johnson, W.H. Freeman and Company, 1979. NP-Completeness 1 General Problems, Input Size and
More informationTHE COMPLEXITY OF DISSOCIATION SET PROBLEMS IN GRAPHS. 1. Introduction
THE COMPLEXITY OF DISSOCIATION SET PROBLEMS IN GRAPHS YURY ORLOVICH, ALEXANDRE DOLGUI, GERD FINKE, VALERY GORDON, FRANK WERNER Abstract. A subset of vertices in a graph is called a dissociation set if
More informationChapter 11. Approximation Algorithms. Slides by Kevin Wayne Pearson-Addison Wesley. All rights reserved.
Chapter 11 Approximation Algorithms Slides by Kevin Wayne. Copyright @ 2005 Pearson-Addison Wesley. All rights reserved. 1 P and NP P: The family of problems that can be solved quickly in polynomial time.
More informationEssential facts about NP-completeness:
CMPSCI611: NP Completeness Lecture 17 Essential facts about NP-completeness: Any NP-complete problem can be solved by a simple, but exponentially slow algorithm. We don t have polynomial-time solutions
More informationLecture 4: NP and computational intractability
Chapter 4 Lecture 4: NP and computational intractability Listen to: Find the longest path, Daniel Barret What do we do today: polynomial time reduction NP, co-np and NP complete problems some examples
More informationThe Multiple Traveling Salesman Problem with Time Windows: Bounds for the Minimum Number of Vehicles
The Multiple Traveling Salesman Problem with Time Windows: Bounds for the Minimum Number of Vehicles Snežana Mitrović-Minić Ramesh Krishnamurti School of Computing Science, Simon Fraser University, Burnaby,
More informationApproximating the minimum quadratic assignment problems
Approximating the minimum quadratic assignment problems Refael Hassin Asaf Levin Maxim Sviridenko Abstract We consider the well-known minimum quadratic assignment problem. In this problem we are given
More informationPolynomial-time Reductions
Polynomial-time Reductions Disclaimer: Many denitions in these slides should be taken as the intuitive meaning, as the precise meaning of some of the terms are hard to pin down without introducing the
More informationComplexity analysis of the discrete sequential search problem with group activities
Complexity analysis of the discrete sequential search problem with group activities Coolen K, Talla Nobibon F, Leus R. KBI_1313 Complexity analysis of the discrete sequential search problem with group
More informationCS 350 Algorithms and Complexity
CS 350 Algorithms and Complexity Winter 2019 Lecture 15: Limitations of Algorithmic Power Introduction to complexity theory Andrew P. Black Department of Computer Science Portland State University Lower
More informationCS 350 Algorithms and Complexity
1 CS 350 Algorithms and Complexity Fall 2015 Lecture 15: Limitations of Algorithmic Power Introduction to complexity theory Andrew P. Black Department of Computer Science Portland State University Lower
More informationComputer Science 385 Analysis of Algorithms Siena College Spring Topic Notes: Limitations of Algorithms
Computer Science 385 Analysis of Algorithms Siena College Spring 2011 Topic Notes: Limitations of Algorithms We conclude with a discussion of the limitations of the power of algorithms. That is, what kinds
More informationP P P NP-Hard: L is NP-hard if for all L NP, L L. Thus, if we could solve L in polynomial. Cook's Theorem and Reductions
Summary of the previous lecture Recall that we mentioned the following topics: P: is the set of decision problems (or languages) that are solvable in polynomial time. NP: is the set of decision problems
More information[3] R.M. Colomb and C.Y.C. Chung. Very fast decision table execution of propositional
- 14 - [3] R.M. Colomb and C.Y.C. Chung. Very fast decision table execution of propositional expert systems. Proceedings of the 8th National Conference on Articial Intelligence (AAAI-9), 199, 671{676.
More informationON COST MATRICES WITH TWO AND THREE DISTINCT VALUES OF HAMILTONIAN PATHS AND CYCLES
ON COST MATRICES WITH TWO AND THREE DISTINCT VALUES OF HAMILTONIAN PATHS AND CYCLES SANTOSH N. KABADI AND ABRAHAM P. PUNNEN Abstract. Polynomially testable characterization of cost matrices associated
More informationSAT, Coloring, Hamiltonian Cycle, TSP
1 SAT, Coloring, Hamiltonian Cycle, TSP Slides by Carl Kingsford Apr. 28, 2014 Sects. 8.2, 8.7, 8.5 2 Boolean Formulas Boolean Formulas: Variables: x 1, x 2, x 3 (can be either true or false) Terms: t
More informationOn the Complexity of Budgeted Maximum Path Coverage on Trees
On the Complexity of Budgeted Maximum Path Coverage on Trees H.-C. Wirth An instance of the budgeted maximum coverage problem is given by a set of weighted ground elements and a cost weighted family of
More informationCounting and Constructing Minimal Spanning Trees. Perrin Wright. Department of Mathematics. Florida State University. Tallahassee, FL
Counting and Constructing Minimal Spanning Trees Perrin Wright Department of Mathematics Florida State University Tallahassee, FL 32306-3027 Abstract. We revisit the minimal spanning tree problem in order
More informationImproved Fully Polynomial time Approximation Scheme for the 0-1 Multiple-choice Knapsack Problem
Improved Fully Polynomial time Approximation Scheme for the 0-1 Multiple-choice Knapsack Problem Mukul Subodh Bansal V.Ch.Venkaiah International Institute of Information Technology Hyderabad, India Abstract
More informationCombinatorial Optimization
Combinatorial Optimization Problem set 8: solutions 1. Fix constants a R and b > 1. For n N, let f(n) = n a and g(n) = b n. Prove that f(n) = o ( g(n) ). Solution. First we observe that g(n) 0 for all
More informationNew Integer Programming Formulations of the Generalized Travelling Salesman Problem
American Journal of Applied Sciences 4 (11): 932-937, 2007 ISSN 1546-9239 2007 Science Publications New Integer Programming Formulations of the Generalized Travelling Salesman Problem Petrica C. Pop Department
More informationNP-Completeness. f(n) \ n n sec sec sec. n sec 24.3 sec 5.2 mins. 2 n sec 17.9 mins 35.
NP-Completeness Reference: Computers and Intractability: A Guide to the Theory of NP-Completeness by Garey and Johnson, W.H. Freeman and Company, 1979. NP-Completeness 1 General Problems, Input Size and
More informationGraduate Algorithms CS F-21 NP & Approximation Algorithms
Graduate Algorithms CS673-2016F-21 NP & Approximation Algorithms David Galles Department of Computer Science University of San Francisco 21-0: Classes of Problems Consider three problem classes: Polynomial
More informationHamiltonian Cycle in Cubic Hamiltonian Graphs. Abstract. It is a simple fact that cubic Hamiltonian graphs have at least two Hamiltonian
On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs Cristina Bazgan y Miklos Santha z Zsolt Tuza x Abstract It is a simple fact that cubic Hamiltonian graphs have at
More informationOn shredders and vertex connectivity augmentation
On shredders and vertex connectivity augmentation Gilad Liberman The Open University of Israel giladliberman@gmail.com Zeev Nutov The Open University of Israel nutov@openu.ac.il Abstract We consider the
More informationChapter 1. Comparison-Sorting and Selecting in. Totally Monotone Matrices. totally monotone matrices can be found in [4], [5], [9],
Chapter 1 Comparison-Sorting and Selecting in Totally Monotone Matrices Noga Alon Yossi Azar y Abstract An mn matrix A is called totally monotone if for all i 1 < i 2 and j 1 < j 2, A[i 1; j 1] > A[i 1;
More informationInteger Programming Methods LNMB
Integer Programming Methods LNMB 2017 2018 Dion Gijswijt homepage.tudelft.nl/64a8q/intpm/ Dion Gijswijt Intro IntPM 2017-2018 1 / 24 Organisation Webpage: homepage.tudelft.nl/64a8q/intpm/ Book: Integer
More informationChapter 3: Proving NP-completeness Results
Chapter 3: Proving NP-completeness Results Six Basic NP-Complete Problems Some Techniques for Proving NP-Completeness Some Suggested Exercises 1.1 Six Basic NP-Complete Problems 3-SATISFIABILITY (3SAT)
More informationApproximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack
Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack Hassene Aissi, Cristina Bazgan, and Daniel Vanderpooten LAMSADE, Université Paris-Dauphine, France {aissi,bazgan,vdp}@lamsade.dauphine.fr
More informationChapter 8. NP and Computational Intractability. Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved.
Chapter 8 NP and Computational Intractability Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved. 1 8.5 Sequencing Problems Basic genres.! Packing problems: SET-PACKING,
More informationApproximation Algorithms for Re-optimization
Approximation Algorithms for Re-optimization DRAFT PLEASE DO NOT CITE Dean Alderucci Table of Contents 1.Introduction... 2 2.Overview of the Current State of Re-Optimization Research... 3 2.1.General Results
More informationApproximation Hardness of TSP with Bounded Metrics. Abstract. The general asymmetric (and metric) TSP is known
Approximation Hardness of TSP with Bounded Metrics Lars Engebretsen? Marek Karpinski?? Abstract. The general asymmetric (and metric) TSP is known to be approximable only to within an O(log n) factor, and
More informationA note on network reliability
A note on network reliability Noga Alon Institute for Advanced Study, Princeton, NJ 08540 and Department of Mathematics Tel Aviv University, Tel Aviv, Israel Let G = (V, E) be a loopless undirected multigraph,
More informationA constant approximation algorithm for the a priori traveling salesman problem
A constant approximation algorithm for the a priori traveling salesman problem David Shmoys 1 and Kunal Talwar 2 1 Cornell University, Ithaca NY 14853 shmoys@cs.cornell.edu 2 Microsoft Research, Silicon
More informationOut-colourings of Digraphs
Out-colourings of Digraphs N. Alon J. Bang-Jensen S. Bessy July 13, 2017 Abstract We study vertex colourings of digraphs so that no out-neighbourhood is monochromatic and call such a colouring an out-colouring.
More informationAlgorithm Design and Analysis
Algorithm Design and Analysis LECTURE 26 Computational Intractability Polynomial Time Reductions Sofya Raskhodnikova S. Raskhodnikova; based on slides by A. Smith and K. Wayne L26.1 What algorithms are
More informationTheory of Computation Chapter 1: Introduction
Theory of Computation Chapter 1: Introduction Guan-Shieng Huang Sep. 20, 2006 Feb. 9, 2009 0-0 Text Book Computational Complexity, by C. H. Papadimitriou, Addison-Wesley, 1994. 1 References Garey, M.R.
More informationUsing DNA to Solve NP-Complete Problems. Richard J. Lipton y. Princeton University. Princeton, NJ 08540
Using DNA to Solve NP-Complete Problems Richard J. Lipton y Princeton University Princeton, NJ 08540 rjl@princeton.edu Abstract: We show how to use DNA experiments to solve the famous \SAT" problem of
More informationGeometric Steiner Trees
Geometric Steiner Trees From the book: Optimal Interconnection Trees in the Plane By Marcus Brazil and Martin Zachariasen Part 3: Computational Complexity and the Steiner Tree Problem Marcus Brazil 2015
More informationCS/COE
CS/COE 1501 www.cs.pitt.edu/~nlf4/cs1501/ P vs NP But first, something completely different... Some computational problems are unsolvable No algorithm can be written that will always produce the correct
More informationChapter 34: NP-Completeness
Graph Algorithms - Spring 2011 Set 17. Lecturer: Huilan Chang Reference: Cormen, Leiserson, Rivest, and Stein, Introduction to Algorithms, 2nd Edition, The MIT Press. Chapter 34: NP-Completeness 2. Polynomial-time
More informationLecture 4: An FPTAS for Knapsack, and K-Center
Comp 260: Advanced Algorithms Tufts University, Spring 2016 Prof. Lenore Cowen Scribe: Eric Bailey Lecture 4: An FPTAS for Knapsack, and K-Center 1 Introduction Definition 1.0.1. The Knapsack problem (restated)
More informationUniversity of Twente. Faculty of Mathematical Sciences. Scheduling split-jobs on parallel machines. University for Technical and Social Sciences
Faculty of Mathematical Sciences University of Twente University for Technical and Social Sciences P.O. Box 217 7500 AE Enschede The Netherlands Phone: +31-53-4893400 Fax: +31-53-4893114 Email: memo@math.utwente.nl
More informationMachine Minimization for Scheduling Jobs with Interval Constraints
Machine Minimization for Scheduling Jobs with Interval Constraints Julia Chuzhoy Sudipto Guha Sanjeev Khanna Joseph (Seffi) Naor Abstract The problem of scheduling jobs with interval constraints is a well-studied
More informationLecture 5: Efficient PAC Learning. 1 Consistent Learning: a Bound on Sample Complexity
Universität zu Lübeck Institut für Theoretische Informatik Lecture notes on Knowledge-Based and Learning Systems by Maciej Liśkiewicz Lecture 5: Efficient PAC Learning 1 Consistent Learning: a Bound on
More informationSingle Machine Scheduling with a Non-renewable Financial Resource
Single Machine Scheduling with a Non-renewable Financial Resource Evgeny R. Gafarov a, Alexander A. Lazarev b Institute of Control Sciences of the Russian Academy of Sciences, Profsoyuznaya st. 65, 117997
More informationComplexity Theory VU , SS The Polynomial Hierarchy. Reinhard Pichler
Complexity Theory Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 15 May, 2018 Reinhard
More informationThe Complexity and Approximability of Finding. Maximum Feasible Subsystems of Linear Relations. Abstract
The Complexity and Approximability of Finding Maximum Feasible Subsystems of Linear Relations Edoardo Amaldi Department of Mathematics Swiss Federal Institute of Technology CH-1015 Lausanne amaldi@dma.epfl.ch
More informationOutline. Complexity Theory EXACT TSP. The Class DP. Definition. Problem EXACT TSP. Complexity of EXACT TSP. Proposition VU 181.
Complexity Theory Complexity Theory Outline Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität
More informationAll-norm Approximation Algorithms
All-norm Approximation Algorithms Yossi Azar Leah Epstein Yossi Richter Gerhard J. Woeginger Abstract A major drawback in optimization problems and in particular in scheduling problems is that for every
More informationApproximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs Haim Kaplan Tel-Aviv University, Israel haimk@post.tau.ac.il Nira Shafrir Tel-Aviv University, Israel shafrirn@post.tau.ac.il
More informationOn dependent randomized rounding algorithms
Operations Research Letters 24 (1999) 105 114 www.elsevier.com/locate/orms On dependent randomized rounding algorithms Dimitris Bertsimas a;, Chungpiaw Teo b, Rakesh Vohra c a Sloan School of Management
More informationNP-complete Problems
NP-complete Problems HP, TSP, 3COL, 0/1IP Dimitris Diamantis µπλ November 6, 2014 Dimitris Diamantis (µπλ ) NP-complete Problems November 6, 2014 1 / 34 HAMILTON PATH is NP-Complete Definition Given an
More informationScheduling Parallel Jobs with Linear Speedup
Scheduling Parallel Jobs with Linear Speedup Alexander Grigoriev and Marc Uetz Maastricht University, Quantitative Economics, P.O.Box 616, 6200 MD Maastricht, The Netherlands. Email: {a.grigoriev, m.uetz}@ke.unimaas.nl
More informationCS 301: Complexity of Algorithms (Term I 2008) Alex Tiskin Harald Räcke. Hamiltonian Cycle. 8.5 Sequencing Problems. Directed Hamiltonian Cycle
8.5 Sequencing Problems Basic genres. Packing problems: SET-PACKING, INDEPENDENT SET. Covering problems: SET-COVER, VERTEX-COVER. Constraint satisfaction problems: SAT, 3-SAT. Sequencing problems: HAMILTONIAN-CYCLE,
More informationAlgorithms and Complexity Theory. Chapter 8: Introduction to Complexity. Computer Science - Durban - September 2005
Algorithms and Complexity Theory Chapter 8: Introduction to Complexity Jules-R Tapamo Computer Science - Durban - September 2005 Contents 1 Introduction 2 1.1 Dynamic programming...................................
More informationEfficient Approximation for Restricted Biclique Cover Problems
algorithms Article Efficient Approximation for Restricted Biclique Cover Problems Alessandro Epasto 1, *, and Eli Upfal 2 ID 1 Google Research, New York, NY 10011, USA 2 Department of Computer Science,
More informationLecture 18: More NP-Complete Problems
6.045 Lecture 18: More NP-Complete Problems 1 The Clique Problem a d f c b e g Given a graph G and positive k, does G contain a complete subgraph on k nodes? CLIQUE = { (G,k) G is an undirected graph with
More informationFinding and Counting Given Length Cycles 1. multiplication. Even cycles in undirected graphs can be found even faster. A C 4k 2 in an undirected
Algorithmica (1997 17: 09 3 Algorithmica 1997 Springer-Verlag New York Inc. Finding and Counting Given Length Cycles 1 N. Alon, R. Yuster, and U. Zwick Abstract. We present an assortment of methods for
More informationUpper and Lower Bounds on the Number of Faults. a System Can Withstand Without Repairs. Cambridge, MA 02139
Upper and Lower Bounds on the Number of Faults a System Can Withstand Without Repairs Michel Goemans y Nancy Lynch z Isaac Saias x Laboratory for Computer Science Massachusetts Institute of Technology
More informationPart V. Intractable Problems
Part V Intractable Problems 507 Chapter 16 N P-Completeness Up to now, we have focused on developing efficient algorithms for solving problems. The word efficient is somewhat subjective, and the degree
More informationLecture Notes 4. Issued 8 March 2018
CM30073 Advanced Algorithms and Complexity 1. Structure of the class NP Lecture Notes 4 Issued 8 March 2018 Recall that it is not known whether or not P = NP, the widely accepted hypothesis being that
More informationVariants of MAX WEIGHTED SAT and MIN WEIGHTED SAT have been considered in the literature, dened by making restrictions on the size of the clauses in t
On the Complexity of Approximating Weighted Satisability Problems (Extended Abstract) Paola Alimonti yzx Giorgio Ausiello y Loredana Giovaniello z Marco Protasi z Abstract The maximum weighted satisability
More informationCS 583: Algorithms. NP Completeness Ch 34. Intractability
CS 583: Algorithms NP Completeness Ch 34 Intractability Some problems are intractable: as they grow large, we are unable to solve them in reasonable time What constitutes reasonable time? Standard working
More informationSolving the Hamiltonian Cycle problem using symbolic determinants
Solving the Hamiltonian Cycle problem using symbolic determinants V. Ejov, J.A. Filar, S.K. Lucas & J.L. Nelson Abstract In this note we show how the Hamiltonian Cycle problem can be reduced to solving
More informationReport No On the Complexity of Testing Membership. in the Core of Min-cost Spanning Tree Games
Report No. 94.166 On the Complexity of Testing Membership in the Core of Min-cost Spanning Tree Games by U. Faigle, S. Fekete, W. Hochstattler, W. Kern 1994 Ulrich Faigle Walter Kern Department of Applied
More informationContents. Typical techniques. Proving hardness. Constructing efficient algorithms
Contents Typical techniques Proving hardness Constructing efficient algorithms Generating Maximal Independent Sets Consider the generation of all maximal sets of an independence system. Generating Maximal
More informationIE418 Integer Programming
IE418: Integer Programming Department of Industrial and Systems Engineering Lehigh University 23rd February 2005 The Ingredients Some Easy Problems The Hard Problems Computational Complexity The ingredients
More informationAlgorithms Design & Analysis. Approximation Algorithm
Algorithms Design & Analysis Approximation Algorithm Recap External memory model Merge sort Distribution sort 2 Today s Topics Hard problem Approximation algorithms Metric traveling salesman problem A
More informationEasy Problems vs. Hard Problems. CSE 421 Introduction to Algorithms Winter Is P a good definition of efficient? The class P
Easy Problems vs. Hard Problems CSE 421 Introduction to Algorithms Winter 2000 NP-Completeness (Chapter 11) Easy - problems whose worst case running time is bounded by some polynomial in the size of the
More informationOn the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy
On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy Ishay Haviv Oded Regev Amnon Ta-Shma March 12, 2007 Abstract In 1991, Papadimitriou and Yannakakis gave a reduction
More information