DOCSLIB.ORG

Sorting Noisy Data with Partial Information

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Sorting Noisy Data with Partial Information Sorting Noisy Data with Partial Information Konstantin Makarychev Yury Makarychev∗ Aravindan Microsoft Research TTIC Vijayaraghavan CMU ABSTRACT of the vertices, which minimizes the number of backward In this paper, we propose two semi-random models for the edges (according to the ordering). Minimum Feedback Arc Set Problem and present approxi- Definition 1.1 Given a directed graph G(V,E) and a ver- mation algorithms for them. In the first model, which we call tex ordering π : V 1,...,n , we say that an edge (arc) the Random Edge Flipping model, an instance is generated (u, v) E is a forward→ { edge w.r.t} π if π(u) < π(v); other- as follows. We start with an arbitrary acyclic directed graph wise, we∈ say that the edge is a backward edge w.r.t. π. and then randomly flip its edges (the adversary may later un-flip some of them). In the second model, which we call Definition 1.2 The Minimum Feedback Arc Set problem is the Random Backward Edge model, again we start with an as follows. Given a directed graph G =(V,E), find a vertex arbitrary acyclic graph but now add new random backward ordering π : V 1,...,n that minimizes the number of edges (the adversary may delete some of them). For the first backward edges w.r.t.→ { π. The} value of the problem equals the model, we give an approximation algorithm that finds a so- number of backward edges w.r.t. the optimal ordering. lution of cost (1 + δ) opt-cost +n polylog n, where opt-cost is the cost of the optimal solution. For the second model, The history of the problem dates back to as early as we give an approximation algorithm that finds a solution of 1957, when Unger [Ung57] considered it in his paper on cost O(planted-cost)+n polylog n, where planted-cost is the asynchronous logical feedback networks. The interest in cost of the planted solution. FAS stems from its numerous applications in simplifying Additionally, we present an approximation algorithm for the analysis of feedback systems (removing feedback loops) semi-random instances of Minimum Directed Balanced Cut. [Ung57, SR61], finding inconsistencies and cyclic dependen- cies [You63], and ranking based on pairwise information [KS63, ACN08]. It is the complementary problem of the Categories and Subject Descriptors Maximum Acyclic Subgraph [BS90, CMM07, GMR08], which F.2 [Theory of Computation]: Analysis of Algorithms asks to find the largest acyclic graph (w.r.t. the number of edges) in a given digraph. Keywords The problem has been extensively studied in the litera- ture. Karp [Kar72] showed that the problem is NP-hard Minimum Feedback Arc Set, semi-random model, average- in 1972, and Kann [Kan92] showed that the problem is case analysis, approximation algorithm APX-hard in 1992. Furthermore, Guruswami, Manokaran, and Raghavendra [GMR08] showed that there is no con- 1. INTRODUCTION stant factor approximation for FAS, assuming the Unique Games Conjecture. In their seminal paper, Leighton and The Minimum Feedback Arc Set (FAS) problem is one Rao [LR99] gave the first polylogarithmic approximation al- of the most basic optimization problems in the context of gorithm for the problem with approximation factor O(log2 n). directed graphs. The problem asks to find the minimum set This result was later improved by Seymour [Sey95], who of edges (arcs) whose removal makes a given graph a directed used a clever divide and conquer approach to get an approxi- acyclic graph (DAG). As any directed acyclic graph can be mation factor of O(log n log log n). His technique was gener- topologically sorted, this is equivalent to finding an ordering alized by Even, Naor, Rao, and Schieber to a more general family of ordering problems by the method of spreading- ∗Supported in part by NSF CAREER grant CCF-1150062. metrics [ENRS00]. Several researchers studied the special case of tournaments, directed graphs in which every pair of vertices is connected by a directed edge [ACN08, CFR06, Permission to make digital or hard copies of all or part of this work for KMS07]; Kenyon-Mathieu and Schudy gave a polynomial- personal or classroom use is granted without fee provided that copies are time approximation scheme (PTAS) for FAS in tournaments not made or distributed for profit or commercial advantage and that copies [KMS07]. To summarize, despite our best efforts we only bear this notice and the full citation on the first page. To copy otherwise, to know polylogarithmic approximation algorithms for the prob- republish, to post on servers or to redistribute to lists, requires prior specific lem, and, assuming the Unique Games Conjecture, we can- permission and/or a fee. ITCS'13, January 9–12, 2012, Berkeley, California, USA. not get a constant factor approximation for worst-case in- Copyright 2013 ACM 978-1-4503-1859-4/13/01 ...$15.00. stances. However, our primary interest in such optimization prob- pages, based on the user feedback1. It is natural to assume lems comes from many different applications they arise in. that there is a true underlying order among these web pages, The instances that we encounter in the real world are not and our goal is to find it. The pairwise comparisons that we worst-case instances. Besides, instances that are produced see are likely to be noisy perturbations of the true ordering. in hardness reductions are often contrived, and we are un- Note that it is unrealistic to expect that we have compar- likely to encounter them in practice. Also it may be too isons for all pairs of web pages. hard, if not impossible, to design an algorithm that gives This motivates the following formal definition for our first a good approximation guarantee for every instance of FAS. semi-random model: This motivates the study of the average-case complexity of Definition 1.3 (Random Edge Flipping Model) the problem. We are given a set of vertices V of size n, and a parameter Question 1 Can we design algorithms with better provable ε. A semi-random instance of the Random Edge Flipping approximation guarantees for realistic average-case models model is generated as follows. for the Minimum Feedback Arc Set problem? 1. Adversary chooses a directed acyclic graph on V , i.e. Braverman and Mossel [BM08] studied the problem of she chooses a set of edges E so that G(V,E) is acyclic. sorting in the presence of random noise. The problem corre- 2. Every edge in E is flipped (its direction is reversed) sponds to FAS on tournaments with random noise. In their with probability ε independently at random. The set of random model, the instance is generated as follows. There flipped edges is denoted by E . is a planted (complete) ordering of the vertices. An edge is R added between every pair of vertices: the edge is directed to 3. The adversary chooses a subset of edges in ER (pos- 1 respect the ordering with probability 2 + ε and it is directed sibly empty) and un-flips them (restores the original 1 against the ordering with probability 2 ε. Braverman and direction). Mossel show that with high probability,− we can find the op- Our second semi-random model for FAS is called the Ran- timal ordering, and the optimal ordering is at most O(n) far dom Backward Edge model. Informally speaking, the in- from the planted ordering (in ` distance). This result re- 1 stance consists of an adversarial directed acyclic graph and quires that we have complete (but noisy) information; that a set of random backward edges, i.e. random edges directed is, the digraph must be a tournament. The result does not opposite to the ordering. The planted solution to FAS con- apply to more general instances of FAS. sists of these random backward edges. Our goal is to find a In this paper, we propose and study two new semi-random solution whose cost is comparable to the cost of the planted models for FAS, which we believe capture many properties of solution. real world instances. We develop new algorithms for semi- random instances of FAS which give (1 + δ) and constant Definition 1.4 (Random Backward Edge Model) We factor approximations in these two models (see below for are given a set of vertices V of size n, and a parameter ε. A the precise statements). In the process, we also develop a semi-random instance of the Random Backward Edge model constant factor approximations for a natural semi-random is generated as follows. model for Minimum Directed Balanced Cut. Our models are geared towards the two chief applications 1. The adversary chooses an ordering π of V . of FAS: noisy topological sorting and breaking cyclic de- 2. Nature adds a random set of backward edges to G: for pendencies. In both of these semi-random models, a semi- every pair (u, v) with π(u) >π(v), nature adds an edge random instance can be seen as an acyclic digraph (a FAS (u, v) to G with probability ε. The choices for all edges instance with cost 0), augmented with random noise. are independent. The set of random edges is denoted 1.1 Semi-random Models by ER. We now describe the two semi-random models for FAS 3. The adversary adds an arbitrary set of forward edges that we study in this paper. w.r.t. π. She also removes some set (possibly empty) Our first semi-random model is called the Random Edge of backward edges added by nature. Flipping model. It models the problem of topological sort- (Note that this model is stronger than a model where the ing in the presence of a noisy oracle.
Load more

Recommended publications
  • An Efficient Implementation of Sugiyama's Algorithm for Layered
    Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 9, no. 3, pp. 305–325 (2005) An Efficient Implementation of Sugiyama’s Algorithm for Layered Graph Drawing Markus Eiglsperger Z¨uhlke Engineering AG 8952 Schlieren, Switzerland Martin Siebenhaller WSI f¨urInformatik, Universit¨at T¨ubingen Sand 13, 72076 T¨ubingen, Germany [email protected] Michael Kaufmann WSI f¨urInformatik, Universit¨at T¨ubingen Sand 13, 72076 T¨ubingen, Germany [email protected] Abstract Sugiyama’s algorithm for layered graph drawing is very popular and commonly used in practical software. The extensive use of dummy vertices to break long edges between non-adjacent layers often leads to unsatis- fying performance. The worst-case running-time of Sugiyama’s approach is O(|V ||E| log |E|) requiring O(|V ||E|) memory, which makes it unusable for the visualization of large graphs. By a conceptually simple new tech- nique we are able to keep the number of dummy vertices and edges linear in the size of the graph without increasing the number of crossings. We reduce the worst-case time complexity of Sugiyama’s approach by an order of magnitude to O((|V | + |E|) log |E|) requiring O(|V | + |E|) space. Article Type Communicated by Submitted Revised Regular paper E. R. Gansner and J. Pach November 2004 July 2005 This work has partially been supported by the DFG-grant Ka512/8-2. It has been performed when the first author was with the Universit¨atT¨ubingen. Eiglsperger et al., Implementing Sugiyama’s Alg., JGAA, 9(3) 305–325 (2005)306 1 Introduction Most approaches for drawing directed graphs used in practice follow the frame- work developed by Sugiyama et al.
    [Show full text]
  • Sorting Heuristics for the Feedback Arc Set Problem
    Sorting Heuristics for the Feedback Arc Set Problem Franz J. Brandenburg and Kathrin Hanauer Department of Informatics and Mathematics, University of Passau fbrandenb;[email protected] Technical Report, Number MIP-1104 Department of Informatics and Mathematics University of Passau, Germany February 2011 Sorting Heuristics for the Feedback Arc Set Problem? Franz J. Brandenburg and Kathrin Hanauer University of Passau, Germany fbrandenb,[email protected] Abstract. The feedback arc set problem plays a prominent role in the four-phase framework to draw directed graphs, also known as the Sugiyama algorithm. It is equivalent to the linear arrangement problem where the vertices of a graph are ordered from left to right and the backward arcs form the feedback arc set. In this paper we extend classical sorting algorithms to heuristics for the feedback arc set problem. Established algorithms are considered from this point of view, where the directed arcs between vertices serve as binary comparators. We analyze these algorithms and afterwards design hybrid algorithms by their composition in order to gain further improvements. These algorithms primarily differ in the use of insertion sort and sifting and they are very similar in their performance, which varies by about 0:1%. The differences mainly lie in their run time and their convergence to a local minimum. Our studies extend related work by new algorithms and our experiments are conducted on much larger graphs. Overall we can conclude that sifting performs better than insertion sort. 1 Introduction The feedback arc set problem (FAS) asks for a minimum sized subset of arcs of a directed graph whose removal or reversal makes the graph acyclic.
    [Show full text]
  • An Exact Method for the Minimum Feedback Arc Set Problem
    AN EXACT METHOD FOR THE MINIMUM FEEDBACK ARC SET PROBLEM ALI BAHAREV, HERMANN SCHICHL, ARNOLD NEUMAIER, TOBIAS ACHTERBERG Abstract. Given a directed graph G, a feedback arc set of G is a subset of its edges containing at least one edge of every cycle in G. Finding a feedback arc set of minimum cardinality is the minimum feedback arc set problem. The minimum set cover formulation of the minimum feedback arc set problem is appropriate as long as all the simple cycles in G can be enumerated. Unfortunately, even sparse graphs can have W(2n) simple cycles, and such graphs appear in practice. An exact method is proposed for sparse graphs that enumerates simple cycles in a lazy fashion, and extends an incomplete cycle matrix iteratively. In all cases encountered so far, only a tractable number of cycles has to be enumerated until a minimum feedback arc set is found. Numerical results are given on a test set containing computationally challenging sparse graphs, relevant for industrial applications. Key words. minimum feedback arc set, maximum acyclic subgraph, minimum feedback vertex set, linear ordering problem, tearing 1. Introduction. A directed graph G is a pair (V;E) of finite sets, the vertices V and the edges E V V. It is a simple graph if it has no multiple edges or self-loops (edges of ⊆ × the form (v;v)). Let G = (V;E) denote a simple directed graph, and let n = V denote the j j number of vertices (nodes), and m = E denote the number of edges. A subgraph H of the j j graph G is said to be induced if, for every pair of vertices u and v of H, (u;v) is an edge of H if and only if (u;v) is an edge of G.
    [Show full text]
  • A Generalization of the Directed Graph Layering Problem
    A Generalization of the Directed Graph Layering Problem Ulf R¨uegg1, Thorsten Ehlers1, Miro Sp¨onemann2, and Reinhard von Hanxleden1 1 Dept. of Computer Science, Kiel University, Kiel, Germany furu,the,[email protected] 2 TypeFox GmbH, Kiel, Germany [email protected] Abstract. The Directed Layering Problem (DLP) solves a step of the widely used layer-based approach to automatically draw directed acyclic graphs. To cater for cyclic graphs, usually a preprocessing step is used that solves the Feedback Arc Set Problem (FASP) to make the graph acyclic before a layering is determined. Here we present the Generalized Layering Problem (GLP), which solves the combination of DLP and FASP simultaneously, allowing general graphs as input. We present an integer programming model and a heuris- tic to solve the NP-complete GLP and perform thorough evaluations on different sets of graphs and with different implementations for the steps of the layer-based approach. We observe that GLP reduces the number of dummy nodes significantly, can produce more compact drawings, and improves on graphs where DLP yields poor aspect ratios. Keywords: layer-based layout, layer assignment, linear arrangement, feedback arc set, integer programming 1 Introduction The layer-based approach is a well-established and widely used method to au- tomatically draw directed graphs. It is based on the idea to assign nodes to subsequent layers that show the inherent direction of the graph, see Fig. 1a for an example. The approach was introduced by Sugiyama et al. [19] and remains arXiv:1608.07809v1 [cs.OH] 28 Aug 2016 a subject of ongoing research.
    [Show full text]
  • On the Unique Games Conjecture
    On the Unique Games Conjecture Subhash Khot Courant Institute of Mathematical Sciences, NYU ∗ Abstract This article surveys recently discovered connections between the Unique Games Conjec- ture and computational complexity, algorithms, discrete Fourier analysis, and geometry. 1 Introduction Since it was proposed in 2002 by the author [60], the Unique Games Conjecture (UGC) has found many connections between computational complexity, algorithms, analysis, and geometry. This article aims to give a survey of these connections. We first briefly describe how these connections play out, which are then further explored in the subsequent sections. Inapproximability: The main motivation for the conjecture is to prove inapproximability results for NP-complete problems that researchers have been unable to prove otherwise. The UGC states that a specific computational problem called the Unique Game is inapproximable. A gap-preserving reduction from the Unique Game problem then implies inapproximability results for other NP- complete problems. Such a reduction was exhibited in [60] for the Min-2SAT-Deletion problem and it was soon followed by a flurry of reductions for various problems, in some cases using variants of the conjecture. Discrete Fourier Analysis: The inapproximability reductions from the Unique Game problem often use gadgets constructed from a boolean hypercube (also used with a great success in earlier works [18, 49, 51]). The reductions can be alternately viewed as constructions of Probabilistically Checkable Proofs (PCPs) and the gadgets can be viewed as probabilistic checking procedures to check whether a given codeword is a Long Code. Fourier analytic theorems on hypercube play a crucial role in ensuring that the gadgets indeed \work".
    [Show full text]
  • Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Theoretical Computer Science 412 (2011) 2556–2561 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Linear programming based approximation algorithms for feedback set problems in bipartite tournamentsI Anke van Zuylen Institute for Theoretical Computer Science, Tsinghua University, Beijing, China article info a b s t r a c t Keywords: We consider the feedback vertex set and feedback arc set problems on bipartite Feedback vertex set tournaments. We improve on recent results by giving a 2-approximation algorithm for Feedback arc set the feedback vertex set problem. We show that this result is the best that we can attain Bipartite tournament Approximation algorithm when using optimal solutions to a certain linear program as a lower bound on the optimal Linear programming value. For the feedback arc set problem on bipartite tournaments, we show that a recent 4-approximation algorithm proposed by Gupta (2008) [8] is incorrect. We give an alternative 4-approximation algorithm based on an algorithm for the feedback arc set on (non-bipartite) tournaments given by van Zuylen and Williamson (2009) [14]. ' 2010 Elsevier B.V. All rights reserved. 1. Introduction We consider the feedback vertex set problem and the feedback arc set problem on bipartite tournaments. The feedback vertex set problem on a directed graph G D .V ; A/ asks for a set of vertices V 0 of minimum size such that the subgraph of G induced by V nV 0 is acyclic.
    [Show full text]
  • Directed Feedback Vertex Set Problem Is FPT ⋆
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Dagstuhl Research Online Publication Server Directed Feedback Vertex Set Problem is FPT ⋆ Jianer Chen1, Yang Liu1 and Songjian Lu1 Department of Computer Science Texas A&M University College Station, TX 77843, USA {chen,yangliu,sjlu}@cs.tamu.edu Abstract. To decide if the parameterized feedback vertex set problem in directed graph is fixed-parameter tractable is a long standing open problem. In this paper, we prove that the parameterized feed- back vertex set in directed graph is fixed-parameter tractable and give the first FPT algorithm of running time O((1.48k)k nO(1)) for it. As the feedback arc set problem in directed graph can be transformed to a feedback vertex set problem in directed graph, hence we also show that the parameterized feedback arc set problem can be solved in time of O((1.48k)k nO(1)). Keywords. directed feedback vertex set problem, parameterized algo- rithm, fixed-parameter tractability, network flow 1 Introduction The feedback vertex set problem is defined as: given a graph G = (V, E), find a subset F in the graph such that G − F is acyclic. We usually call F a feedback vertex set of G, or an FVS of G. The graph G can be undirected or directed. If we want to find an FVS with minimum size or with a size bounded by k which we call it parameterized feedback vertex set problem, the problem is NP-complete in both directed and undirected graph [15].
    [Show full text]
  • 16.11 Feedback Edge/Vertex Set 559
    16.11 FEEDBACK EDGE/VERTEX SET 559 INPUT OUTPUT 16.11 Feedback Edge/Vertex Set Input description: A (directed) graph G =(V,E). Problem description: What is the smallest set of edges E or vertices V whose deletion leaves an acyclic graph? Discussion: Feedback set problems arise because many things are easier to do on directed acyclic graphs (DAGs) than general digraphs. Consider the problem of scheduling jobs with precedence constraints (i.e. , job A must come before job B). When the constraints are all consistent, the resulting graph is a DAG, and topological sort (see Section 15.2 (page 481)) can be used to order the vertices to respect them. But how can you design a schedule when there are cyclic constraints, such as A must be done before B, which must be done before C,whichmustbe done before A? By identifying a feedback set, we identify the smallest number of constraints that must be dropped to permit a valid schedule. In the feedback edge (or arc) set problem, we drop individual precedence constraints. In the feedback vertex set problem, we drop entire jobs and all constraints associated with them. Similar considerations are involved in eliminating race conditions from elec- tronic circuits. This explains why the problem is called “feedback” set. It is also known as the maximum acyclic subgraph problem. 560 16. GRAPH PROBLEMS: HARD PROBLEMS One final application has to do with ranking tournaments. Suppose we want to rank order the skills of players at some two-player game, such as chess or tennis. We can construct a directed graph where there is an arc from x to y if x beats y in a game.
    [Show full text]
  • Arxiv:1702.07612V1 [Cs.DM] 24 Feb 2017 E-Mail: [email protected]
    Preprint version submitted to Theory of Computing Systems Exact Localisations of Feedback Sets Michael Hecht Abstract The feedback arc (vertex) set problem, shortened FASP (FVSP), is to transform a given multi digraph G = (V; E) into an acyclic graph by deleting as few arcs (vertices) as possible. Due to the results of Richard M. Karp in 1972 it is one of the classic NP-complete problems. An important contribution of this paper is that the subgraphs Gel(e), Gsi(e) of all elementary cycles or simple cycles running through some arc e 2 E, can be computed in OjEj2 and O(jEj4), respectively. We use this fact and introduce the notion of the essential minor and isolated cycles, which yield a priori problem size reductions and in the special case of so called resolvable graphs an exact solution in O(jV jjEj3). We show that weighted versions of the FASP and FVSP possess a Bellman decomposition, which yields exact solutions using a dynamic programming technique in times O2mjEj4 log(jV j) and O2n∆(G)4jV j4 log(jEj), where m ≤ jEj − jV j + 1, n ≤ (∆(G) − 1)jV j − jEj + 1, respectively. The parameters m; n can be computed in O(jEj3), O(∆(G)3jV j3), respectively and denote the maximal dimension of the cycle space of all appearing meta graphs, decoding the intersection behavior of the cycles. Consequently, m; n equal zero if all meta graphs are trees. Moreover, we deliver several heuristics and discuss how to control their variation from the optimum. Summarizing, the presented results allow us to suggest a strategy for an implementation of a fast and accurate FASP/FVSP-SOLVER.
    [Show full text]
  • Inapproximability of Feedback Vertex Set for Bounded Length Cycles
    Electronic Colloquium on Computational Complexity, Report No. 6 (2014) Inapproximability of Feedback Vertex Set for Bounded Length Cycles Venkatesan Guruswami∗ Euiwoong Leey Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213. Abstract The Feedback Vertex Set problem (FVS), where the goal is to find a small subset of ver- tices that intersects every cycle in an input directed graph, is among the fundamental prob- lems whose approximability is not well-understood. One can efficiently find an Oe(log n) factor approximation, and while a constant-factor approximation is ruled out under the Unique Games Conjecture (UGC), the best NP-hardness result is only a factor of ≈ 1:36 (via a simple reduction from Vertex Cover). This work studies a natural variant of the Feedback Vertex Set problem (FVS), where the goal is to find a small subset of vertices that intersects every cycle of bounded length. For this variant, we prove strong NP-hardness of approximation results: For any integer constant k > 3 and > 0, it is hard to find a (k − 1 − )-approximate solution to the problem of intersecting every cycle of length at most k. The hardness result almost matches the trivial factor k approximation algorithm for the problem. In fact, the hardness holds also for the 0 0 problem of hitting every cycle of length at most a parameter k > k where k can be taken log n 0 to be Ω( log log n ). Taking k = !(log n log log n) would be enough to prove a hardness for FVS (for arbitrary length cycles). Our work thus identifies the problem of hitting cycles of length ≈ log n as the key towards resolving the approximability of FVS.
    [Show full text]
  • Inapproximability of Maximum Acyclic Subgraph
    Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph VENKATESAN GURUSWAMI ∗ RAJSEKAR MANOKARAN y PRASAD RAGHAVENDRA z University of Washington Princeton University University of Washington [email protected] [email protected] [email protected] Abstract 1 Introduction Given a directed acyclic graph G, one can efficiently or- We prove that approximating the MAX ACYCLIC SUB- der (“topological sort”) its vertices so that all edges go for- GRAPH problem within a factor better than 1=2 is Unique ward from a lower ranked vertex to a higher ranked vertex. Games hard. Specifically, for every constant " > 0 the fol- But what if a few, say fraction ", of edges of G are reversed? lowing holds: given a directed graph G that has an acyclic Can we detect these “errors” and find an ordering with few subgraph consisting of a fraction (1 − ") of its edges, if one back edges? Formally, given a directed graph whose ver- can efficiently find an acyclic subgraph of G with more than tices admit an ordering with many, i.e., 1 − " fraction, for- (1=2 + ") of its edges, then the UGC is false. Note that ward edges, can we find a good ordering with fraction α it is trivial to find an acyclic subgraph with 1=2 the edges, of forward edges (for some α ! 1)? This is equivalent to by taking either the forward or backward edges in an ar- finding a subgraph of G that is acyclic and has many edges, bitrary ordering of the vertices of G. The existence of a and hence this problem is called the MAX ACYCLIC SUB- ρ-approximation algorithm for ρ > 1=2 has been a basic GRAPH (MAS) problem.
    [Show full text]
  • An Exact Method for the Minimum Feedback
    An exact method for the minimum feedback arc set problem Ali Baharev*, Hermann Schichl, Arnold Neumaier Fakultat¨ fur¨ Mathematik, Universitat¨ Wien Oskar-Morgenstern-Platz 1, A-1090 Wien, Austria email: [email protected] (*) Author to whom all correspondence should be addressed. December 12, 2015 mfes.tex Contents 1 Introduction 2 1.1 Computational complexity . .3 1.2 Connection to tearing in chemical engineering . .4 2 Heuristics 5 3 Exact methods 7 3.1 Integer programming formulation with triangle inequalities . .7 3.2 Integer programming formulation as minimum set cover . .8 4 An integer programming approach with lazy constraint generation 8 4.1 Informal overview of the proposed method . .9 4.2 Pseudo-code of the proposed algorithm . 10 5 Computational results 10 5.1 Comparisons and discussion . 12 5.2 Minimal cycle matrix . 13 A Safely removing edges 15 A.1 Intuition . 16 A.2 Rule to identify edges that are safe remove . 16 A.3 Implementation . 17 A.4 Edge removal experiments . 20 B Plots of the test graphs 27 1 Abstract Given a directed graph G, a feedback arc set of G is a subset of its edges containing at least one edge of every cycle in G. Finding a feedback arc set of minimum cardinality is the minimum feedback arc set problem. The present paper focuses on large and sparse graphs. The minimum set cover formulation of the minimum feedback arc set problem is practical as long as all the simple cycles in G can be enumerated. Unfortunately, even sparse graphs can have W(2n) simple cycles, and such graphs appear in practice.
    [Show full text]