DOCSLIB.ORG

Phase Transitions and Complexity of Weighted Satisfiability and Other

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Phase Transitions and Complexity of Weighted Satisfiability and Other Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (2008) Phase Transitions and Complexity of Weighted Satisfiability and Other Intractable Parameterized Problems Yong Gao Department of Computer Science Irving K. Barber School of Arts and Sciences University of British Columbia Okanagan Kelowna, Canada V1V 1V7 [email protected] Abstract such as backdoor. In particularly, the issue of the worst- case intractability versus the practical hardness of the back- The study of random instances of NP complete and coNP door detection problem has been raised: while the backdoor complete problems has had much impact on our understand- ing of the nature of hard problems. In this work, we initiate detection problem is NP-complete and/or fixed-parameter an effort to extend this line of research to random instances intractable for many types of backdoors, SAT-solvers such of intractable parameterized problems. as SATZ can exploit the existence of small-sized back- We propose random models for a representative intractable doors effectively (Dilkina, Gomes, and Sabharwal 2007; parameterized problem, the weighted d-CNF satisfiability, Szeider 2005). and its generalization to the constraint satisfaction problem. The study of parameterized proof complexity of the The exact threshold for the phase transition of the proposed propositional satisfiability problem has been initiated in models is determined. Lower bounds on the time complex- (Dantchev, Martin, and Szeider 2007), where lower bounds ity of variants of the DPLL algorithm for these parameter- on the parameterized resolution proof are established for ized problems are also established. In particularly, we show CNF formulas that encode some first-order combinatorial that random instances of the weighted 2-CNF satisfiability, principle. already an intractable parameterized problem, are typically easy in both of the satisfiable and unsatisfiable regions by The study of random instances of NP-complete prob- exploiting an interesting connection between the unsatisfia- lems and coNP-complete problems such as SAT has had bility of a weighted 2-CNF formula and the existence of a much impact on our understanding of the nature of hard Hamiltonian-cycle-like global structure. problems (Achlioptas, Beame, and Molloy 2001; Beame et al. 2002; Cheeseman, Kanefsky, and Taylor 1991) as well 1. Introduction as the strength and weakness of well-founded algorithms and heuristics (Gent and Walsh 1998; Gomes et al. 2005; The theory of parameterized complexity and fixed- Gao and Culberson 2007). parameter algorithms is becoming an active research area In this work, we initiate an effort to extend this line of in recent years (Downey and Fellows 1999; Neidermeier research to intractable parameterized problem in the param- 2006). Parameterized complexity provides a new perspec- eterized complexity hierarchy. We propose random models tive on hard algorithmic problems, while fixed-parameter al- for a representative parameterized intractable problem, the gorithms have found applications in a variety of areas such weighted d-CNF satisfiability, and its variants. We establish as computational biology, cognitive modeling, graph theory, the exact threshold of the phase transition of the proposed and various optimization problems. model. This is in contrast to the threshold behavior of most Parameterized algorithmic problems also arise in many of the NP complete problems, such as the satisfiability and areas of artificial intelligence research. See, for example, the graph coloring, where the exact threshold is extremely hard survey of Gottlob and Szeider (Gottlob and Szeider 2007). to nail down. backdoor Recently, some problems related to detecting For the weighted 2-CNF satisfiability problem, which is sets for instances of the propositional satisfiability problem already W[1]-complete, we show that random instances are (SAT) have been studied from the perspective of parameter typically easy in both of the satisfiable and unsatisfiable re- complexity (Szeider 2005; Nishimura, Ragde, and Szeider gions. We prove that random (unsatisfiable) instances of 2004). A backdoor (to instances of a hard problem) is a sub- the weighted 2-CNF satisfiability problem have a “fixed- set of variables that, once fixed, will result in one or more parameter-sized” resolution proof by exploiting an interest- polynomial time sovable subproblems. The existence of ing link between the unsatisfiability of a weighted 2-CNF small sized backdoors naturally leads to fixed-parameter al- formula and the existence of a Hamiltonian cycle in a prop- gorithms. For example, in Bayesian networks and constraint erly defined directed graph. This is somewhat surprising networks, a feedback vertex set of the (directed) network is and indicates that the typical-case behavior of random in- Copyright c 2008, Association for the Advancement of Artificial stances of parameterized problems are quite different from Intelligence (www.aaai.org). All rights reserved. that of NP-complete problems. First, it is the existence of 265 a global structure (a directed Hamiltonian cycle) that leads As in the case of the theory of NP-completeness, the sat- to easy instances, as compared to the case of NP-complete isfiability problem plays an important role in the theory of problems where small structures are usually the signature parameterized complexity (Downey and Fellows 1999). A of easy instances. Secondly, unlike the case of traditional CNF formula (over a set of Boolean variables) is a conjunc- satisfiability, the weighted 2-CNF satisfiability problem is tion of disjunctions of literals. A d-clause is a disjunction of already fixed-parameter intractable. As a comparison, for d-literals. weighted d-CNF satisfiability problem with d > 2, we es- Definition 1. An assignment to a set of n Boolean variables tablish a non-fixed parameter tractable lower bound on the n search tree size of the parameterized version of the ordered is a vector in f0; 1g . The weight of an assignment is the DPLL algorithm. number of the variables that are set to 1 (true) by the as- We observe that there are certain relations between find- signment, i.e., the number of 1’s in the assignment. ing a solution to an instance of the parameterized problem A representative W [1]-complete problem is the following under consideration the tasks of backdoor detection with re- weighted d-CNF satisfiability problem (weighted d-SAT) spect to an (extremely) naive sub-solver that simply checks (Downey and Fellows 1999): whether the all-zero assignment is satisfying, and hope that further investigation along this line may help shed further Problem 1. Weighted d-SAT light on the (typical-case) hardness of the backdoor detec- Input: A CNF formula consisting of d-clauses, and a tion problem and the empirical observation on the effective- positive integer k. ness of practical satisfiability solvers in exploiting small- sized backdoors. Question: Is there a satisfying assignment of weight k? The results reported in the current paper are all of theo- retical nature and the objective is to lay the necessary foun- Unlike the traditional satisfiability problem, weighted dation for a study of the phase transitions and typical-case 2-SAT is already W[1]-complete. The anti-monotone hardness of fixed-parameter intractable problems. We be- weighted d-SAT problem (the problem where each clause lieve that in the future study, empirical studies are indispens- contains negative literatures only) is also W[1]-complete. able, especially for situations where theoretical analyses are The weighted satisfiability problem (weighted SAT) is hard to come by. See, for example, the work in (Gent and similar to weighted d-SAT except that there is no restriction Walsh 1998; Gomes et al. 2005; Gao and Culberson 2007) on the length of a clause in the formula. Weighted SAT is a and the references therein for the many empirical studies on representative W [2]-complete problem. the phase transitions of NP-hard problems. Parameterized Proof Systems and Parameterized 2. Preliminaries DPLL Algorithms Parameterized complexity A formal definition of a parameterized tree-like resolution parameterized decision problem An instance of a is a pair proof system for the weighted d-SAT problem is given in (I; k) where I is a problem instance and k is the problem pa- (Dantchev, Martin, and Szeider 2007). Basically, a param- rameter. Usually, the parameter k either specifies the “size” eterized resolution can be regarded as a classical resolution of the solution or is related to some structural property of that have access (for free) to all clauses with more than k the underlying problem, such as the treewidth of a graph. negated variables, where k is the parameter of the weighted For example, in an instance (I; k) of the parameterized ver- SAT problem. tex cover (VC) problem, I is a graph and k is the size of the vertex cover. The question is to decide whether I has a Accordingly, one can consider the parameterized version vertex cover of size k. of the DPLL algorithm for weighted SAT. It proceeds in the A parameterized problem is fixed-parameter tractable same way as the standard DPLL algorithm with the excep- (FPT) if any instance (I; k) of the problem can be solved tion that a node in the search tree fails if in f(k)jIjO(1) time, where f(k) is a computable function of 1. either a clause has been falsified by the partial assignment, k only. It is known that the parameterized VC problem can be solved in O(1:28k + kn) time where n is the number of 2. or the number of variables assigned to true in the partial vertices of the input graph. assignment has exceeded k. Parameterized problems are inter-related by parameter- In addition to the parameterized version of the general ized reductions, resulting in a classification of parameterized DPLL algorithm, we may also consider the parameterized problems into a hierarchy of complexity classes version of ordered-DPLL and the oblivious-DPLL algo- FPT ⊆ W [1] ⊆ W [2] · · · ⊆ XP: rithms studied in (Beame et al.
Load more

Recommended publications
  • Fixed-Parameter Tractability Marko Samer and Stefan Szeider
    Handbook of Satisfiability 363 Armin Biere, Marijn Heule, Hans van Maaren and Toby Walsch IOS Press, 2008 c 2008 Marko Samer and Stefan Szeider. All rights reserved. Chapter 13 Fixed-Parameter Tractability Marko Samer and Stefan Szeider 13.1. Introduction The propositional satisfiability problem (SAT) is famous for being the first prob- lem shown to be NP-complete—we cannot expect to find a polynomial-time al- gorithm for SAT. However, over the last decade, SAT-solvers have become amaz- ingly successful in solving formulas with thousands of variables that encode prob- lems arising from various application areas. Theoretical performance guarantees, however, are far from explaining this empirically observed efficiency. Actually, theorists believe that the trivial 2n time bound for solving SAT instances with n variables cannot be significantly improved, say to 2o(n) (see the end of Sec- tion 13.2). This enormous discrepancy between theoretical performance guaran- tees and the empirically observed performance of SAT solvers can be explained by the presence of a certain “hidden structure” in instances that come from applica- tions. This hidden structure greatly facilitates the propagation and simplification mechanisms of SAT solvers. Thus, for deriving theoretical performance guaran- tees that are closer to the actual performance of solvers one needs to take this hidden structure of instances into account. The literature contains several sug- gestions for making the vague term of a hidden structure explicit. For example, the hidden structure can be considered as the “tree-likeness” or “Horn-likeness” of the instance (below we will discuss how these notions can be made precise).
    [Show full text]
  • Introduction to Parameterized Complexity
    Introduction to Parameterized Complexity Ignasi Sau CNRS, LIRMM, Montpellier, France UFMG Belo Horizonte, February 2018 1/37 Outline of the talk 1 Why parameterized complexity? 2 Basic definitions 3 Kernelization 4 Some techniques 2/37 Next section is... 1 Why parameterized complexity? 2 Basic definitions 3 Kernelization 4 Some techniques 3/37 Karp (1972): list of 21 important NP-complete problems. Nowadays, literally thousands of problems are known to be NP-hard: unlessP = NP, they cannot be solved in polynomial time. But what does it mean for a problem to be NP-hard? No algorithm solves all instances optimally in polynomial time. Some history of complexity: NP-completeness Cook-Levin Theorem (1971): the SAT problem is NP-complete. 4/37 Nowadays, literally thousands of problems are known to be NP-hard: unlessP = NP, they cannot be solved in polynomial time. But what does it mean for a problem to be NP-hard? No algorithm solves all instances optimally in polynomial time. Some history of complexity: NP-completeness Cook-Levin Theorem (1971): the SAT problem is NP-complete. Karp (1972): list of 21 important NP-complete problems. 4/37 But what does it mean for a problem to be NP-hard? No algorithm solves all instances optimally in polynomial time. Some history of complexity: NP-completeness Cook-Levin Theorem (1971): the SAT problem is NP-complete. Karp (1972): list of 21 important NP-complete problems. Nowadays, literally thousands of problems are known to be NP-hard: unlessP = NP, they cannot be solved in polynomial time. 4/37 Some history of complexity: NP-completeness Cook-Levin Theorem (1971): the SAT problem is NP-complete.
    [Show full text]
  • Exploiting C-Closure in Kernelization Algorithms for Graph Problems
    Exploiting c-Closure in Kernelization Algorithms for Graph Problems Tomohiro Koana Technische Universität Berlin, Algorithmics and Computational Complexity, Germany [email protected] Christian Komusiewicz Philipps-Universität Marburg, Fachbereich Mathematik und Informatik, Marburg, Germany [email protected] Frank Sommer Philipps-Universität Marburg, Fachbereich Mathematik und Informatik, Marburg, Germany [email protected] Abstract A graph is c-closed if every pair of vertices with at least c common neighbors is adjacent. The c-closure of a graph G is the smallest number such that G is c-closed. Fox et al. [ICALP ’18] defined c-closure and investigated it in the context of clique enumeration. We show that c-closure can be applied in kernelization algorithms for several classic graph problems. We show that Dominating Set admits a kernel of size kO(c), that Induced Matching admits a kernel with O(c7k8) vertices, and that Irredundant Set admits a kernel with O(c5/2k3) vertices. Our kernelization exploits the fact that c-closed graphs have polynomially-bounded Ramsey numbers, as we show. 2012 ACM Subject Classification Theory of computation → Parameterized complexity and exact algorithms; Theory of computation → Graph algorithms analysis Keywords and phrases Fixed-parameter tractability, kernelization, c-closure, Dominating Set, In- duced Matching, Irredundant Set, Ramsey numbers Funding Frank Sommer: Supported by the Deutsche Forschungsgemeinschaft (DFG), project MAGZ, KO 3669/4-1. 1 Introduction Parameterized complexity [9, 14] aims at understanding which properties of input data can be used in the design of efficient algorithms for problems that are hard in general. The properties of input data are encapsulated in the notion of a parameter, a numerical value that can be attributed to each input instance I.
    [Show full text]
  • Lower Bounds Based on the Exponential Time Hypothesis
    Lower bounds based on the Exponential Time Hypothesis Daniel Lokshtanov∗ Dániel Marxy Saket Saurabhz Abstract In this article we survey algorithmic lower bound results that have been obtained in the field of exact exponential time algorithms and pa- rameterized complexity under certain assumptions on the running time of algorithms solving CNF-Sat, namely Exponential time hypothesis (ETH) and Strong Exponential time hypothesis (SETH). 1 Introduction The theory of NP-hardness gives us strong evidence that certain fundamen- tal combinatorial problems, such as 3SAT or 3-Coloring, are unlikely to be polynomial-time solvable. However, NP-hardness does not give us any information on what kind of super-polynomial running time is possible for NP-hard problems. For example, according to our current knowledge, the complexity assumption P 6= NP does not rule out the possibility of having an nO(log n) time algorithm for 3SAT or an nO(log log k) time algorithm for k- Clique, but such incredibly efficient super-polynomial algorithms would be still highly surprising. Therefore, in order to obtain qualitative lower bounds that rule out such algorithms, we need a complexity assumption stronger than P 6= NP. Impagliazzo, Paturi, and Zane [38, 37] introduced the Exponential Time Hypothesis (ETH) and the stronger variant, the Strong Exponential Time Hypothesis (SETH). These complexity assumptions state lower bounds on how fast satisfiability problems can be solved. These assumptions can be used as a basis for qualitative lower bounds for other concrete computational problems. ∗Dept. of Comp. Sc. and Engineering, University of California, USA. [email protected] yInstitut für Informatik, Humboldt-Universiät , Berlin, Germany.
    [Show full text]
  • 12. Exponential Time Hypothesis COMP6741: Parameterized and Exact Computation
    12. Exponential Time Hypothesis COMP6741: Parameterized and Exact Computation Serge Gaspers Semester 2, 2017 Contents 1 SAT and k-SAT 1 2 Subexponential time algorithms 2 3 ETH and SETH 2 4 Algorithmic lower bounds based on ETH 2 5 Algorithmic lower bounds based on SETH 3 6 Further Reading 4 1 SAT and k-SAT SAT SAT Input: A propositional formula F in conjunctive normal form (CNF) Parameter: n = jvar(F )j, the number of variables in F Question: Is there an assignment to var(F ) satisfying all clauses of F ? k-SAT Input: A CNF formula F where each clause has length at most k Parameter: n = jvar(F )j, the number of variables in F Question: Is there an assignment to var(F ) satisfying all clauses of F ? Example: (x1 _ x2) ^ (:x2 _ x3 _:x4) ^ (x1 _ x4) ^ (:x1 _:x3 _:x4) Algorithms for SAT • Brute-force: O∗(2n) • ... after > 50 years of SAT solving (SAT association, SAT conference, JSAT journal, annual SAT competitions, ...) • fastest known algorithm for SAT: O∗(2n·(1−1=O(log m=n))), where m is the number of clauses [Calabro, Impagli- azzo, Paturi, 2006] [Dantsin, Hirsch, 2009] • However: no O∗(1:9999n) time algorithm is known 1 • fastest known algorithms for 3-SAT: O∗(1:3303n) deterministic [Makino, Tamaki, Yamamoto, 2013] and O∗(1:3071n) randomized [Hertli, 2014] • Could it be that 3-SAT cannot be solved in 2o(n) time? • Could it be that SAT cannot be solved in O∗((2 − )n) time for any > 0? 2 Subexponential time algorithms NP-hard problems in subexponential time? • Are there any NP-hard problems that can be solved in 2o(n) time? • Yes.
    [Show full text]
  • On Miniaturized Problems in Parameterized Complexity Theory
    On miniaturized problems in parameterized complexity theory Yijia Chen Institut fur¨ Informatik, Humboldt-Universitat¨ zu Berlin, Unter den Linden 6, 10099 Berlin, Germany. [email protected] Jorg¨ Flum Abteilung fur¨ Mathematische Logik, Universitat¨ Freiburg, Eckerstr. 1, 79104 Freiburg, Germany. [email protected] Abstract We introduce a general notion of miniaturization of a problem that comprises the different miniaturizations of concrete problems considered so far. We develop parts of the basic theory of miniaturizations. Using the appropriate logical formalism, we show that the miniaturization of a definable problem in W[t] lies in W[t], too. In particular, the miniaturization of the dominating set problem is in W[2]. Furthermore we investigate the relation between f(k) · no(k) time and subexponential time algorithms for the dominating set problem and for the clique problem. 1. Introduction Parameterized complexity theory provides a framework for a refined complexity analysis of algorithmic problems that are intractable in general. Central to the theory is the notion of fixed-parameter tractability, which relaxes the classical notion of tractability, polynomial time computability, by admitting algorithms whose runtime is exponential, but only in terms of some parameter that is usually expected to be small. Let FPT denote the class of all fixed-parameter tractable problems. A well-known example of a problem in FPT is the vertex cover problem, the parameter being the size of the vertex cover we ask for. As a complexity theoretic counterpart, a theory of parameterized intractability has been developed. In classical complex- ity, the notion of NP-completeness is central to a nice and simple theory for intractable problems.
    [Show full text]
  • Exact Complexity and Satisfiability
    Exact Complexity and Satisfiability (Invited Talk) Russell Impagliazzo and Ramamohan Paturi Department of Computer Science and Engineering University of California, San Diego La Jolla, CA 92093-0404, USA {russell,paturi}@cs.ucsd.edu All NP-complete problems are equivalent as far as polynomial time solv- ability is concerned. However, their exact complexities (worst-case complex- ity of algorithms that solve every instance correctly and exactly) differ widely. Starting with Bellman [1], Tarjan and Trojanowski [9], Karp [5], and Monien and Speckenmeyer [7], the design of improved exponential time al- gorithms for NP-complete problems has been a tremendously fruitful en- deavor, and one that has recently been accelerating both in terms of the number of results and the increasing sophistication of algorithmic techniques. There are a vast variety of problems where progress has been made, e.g., k-sat, k-Colorability, Maximum Independent Set, Hamiltonian Path, Chromatic Number,andCircuit Sat for limited classes of circuits. The “current champion” algorithms for these problems deploy a vast variety of al- gorithmic techniques, e.g., back-tracking search (with its many refinements and novel analysis techniques), divide-and-conquer, dynamic programming, random- ized search, algebraic transforms, inclusion-exclusion, color coding, split and list, and algebraic sieving. In many ways, this is analogous to the diversity of approx- imation ratios and approximation algorithms known for different NP-complete problems. In view of this diversity, it is tempting to focus on the distinctions between problems rather than the interconnections between them. However, over the past two decades, there has been a wave of research showing that such con- nections do exist.
    [Show full text]
  • Parameterized Approximation of Dominating Set Problems
    Parameterized Approximation of Dominating Set Problems Rodney G. Downey1, Michael R. Fellows2, Catherine McCartin3, and Frances Rosamond2 1 Victoria University, Wellington, New Zealand, [email protected] 2 The University of Newcastle, Callaghan, Australia, {michael.fellows,frances.rosamond}@newcastle.edu.au 3 Massey University, Palmerston North, New Zealand, [email protected] Abstract. A problem open for many years is whether there is an FPT algorithm that given a graph G and parameter k, either: (1) determines that G has no k-Dominating Set, or (2) produces a dominating set of size at most g(k), where g(k) is some fixed function of k. Such an outcome is termed an FPT approximation algorithm. We describe some results that begin to provide some answers. We show that there is no such FPT algorithm for g(k) of the form k + c (where c is a fixed con- stant, termed an additive FPT approximation), unless FPT = W [2]. We answer the analogous problem completely for the related Independent Dominating Set (IDS) problem, showing that IDS does not admit an FPT approximation algorithm, for any g(k), unless FPT = W [2]. 1 Introduction Most of the work in the area of parameterized complexity and algorithmics to date has focused on exact algorithms for decision problems. However, the theory of parameterized complexity, which derives from the contrast between timecost functions of the form f(k)nc (fixed-parameter tractability, FPT,) and those of the form ng(k), where n is the overall input size, and k is a relevant secondary parameter of the situation, can clearly be deployed in a variety of ways in analyzing computational complexity.
    [Show full text]
  • Fixed-Parameter Tractability and Parameterized Complexity, Applied to Problems from Computational Social Choice — Mathematical Programming Glossary Supplement —
    Fixed-Parameter Tractability and Parameterized Complexity, Applied to Problems From Computational Social Choice — Mathematical Programming Glossary Supplement — Claudia Lindner and J¨org Rothe Institut f¨ur Informatik Heinrich-Heine-Universit¨at D¨usseldorf 40225 D¨usseldorf, Germany October 17, 2008 Abstract This supplement provides a brief introduction to the field of fixed-parameter tractability and parameterized complexity. Some basic notions are explained and some related results are presented, with a focus on problems arising in the field of computational social choice. 1 Fixed-Parameter Tractability and Parameterized Complexity The study of fixed-parameter tractability and parameterized complexity has emerged as a new field within computational complexity theory in the late 1980s and the early 1990s. Since the early pioneering work of Downey, Fellows, and other researchers this area has established plenty of results, notions, and methods, and it provides a useful framework for dealing in practice with problems considered intractable by classical complexity theory. This supplement gives only a rough sketch of some basic notions and techniques within parameterized complexity theory; for a deeper and more comprehensive treatise, the textbooks by Downey and Fellows [DF99], Flum and Grohe [FG06], and Niedermeier [Nie06] and the survey by Buss and Islam [BI08] are highly recommendable. Let P and NP, respectively, denote the classical (worst-case) complexity classes deterministic polynomial time and nondeterministic polynomial time. Given any two decision problems, A and B, ¡ p we say A polynomial-time many-one reduces to B (denoted A m B) if there is a polynomial-time £ ¤ ¢ computable function f such that, for each input x, x ¢ A if and only if f x B.
    [Show full text]
  • Implications of the Exponential Time Hypothesis
    Implications of the Exponential Time Hypothesis Anant Dhayal May 14, 2018 Abstract The Exponential Time Hypothesis (ETH) [14] states that for k ≥ 3, k-SAT doesn't δn have a sub-exponential time algorithm. Let sk = inffδ j 9 2 time algorithm for solving k-SATg, then ETH is equivalent to s3 > 0. Strong ETH (SETH) [13] is a stronger conjecture which states that lim sk = 1. k!1 In this report we survey lower bounds based on ETH. We describe a reduction from k-SAT to NP-complete CSP's [5]. In particular this implies that no NP-complete CSP has a sub-exponential time algorithm. We also survey lower bounds implied by SETH. 1 Introduction CNF-SAT is the canonical NP-complete problem [9, 17]. A literal is a boolean variable or its negation, and a clause is a disjunction of literals. The input of CNF-SAT is a boolean formula in conjunctive normal form (CNF), i.e., conjunction of clauses. The goal is to check if there is an assignment to the variables which satisfies all the clauses. k-SAT is a special case of CNF-SAT where the clause width (the number of literals in a clause) is bounded by the constant k. When k = 2 the problem has a polynomial time algorithm. However for k ≥ 3 it is proved to be NP-complete [9, 17], hence there is no polynomial time algorithm unless P = NP. When k ≥ 4 there is a simple clause width reduction from k-SAT to (k−1)-SAT wherein we replace a k-clause (x1 _x2 _:::_xk) by two clauses (x1 _x2 _:::_xk−2 _y)^(xk−1 _xk _y) by introducing a new variable y.
    [Show full text]
  • On the Parameterized Complexity of [1, J]-Domination Problems
    On the Parameterized Complexity of [1, j]-Domination Problems Mohsen Alambardar Meybodi Department of Computer Science, Yazd University, Yazd, Iran [email protected] Fedor Fomin Department of Informatics, University of Bergen, Norway [email protected] Amer E. Mouawad Computer Science Department, American University of Beirut, Beirut, Lebanon [email protected] Fahad Panolan Department of Informatics, University of Bergen, Norway [email protected] Abstract For a graph G, a set D ⊆ V (G) is called a [1, j]-dominating set if every vertex in V (G) \ D has at least one and at most j neighbors in D. A set D ⊆ V (G) is called a [1, j]-total dominating set if every vertex in V (G) has at least one and at most j neighbors in D. In the [1, j]-(Total) Dominating Set problem we are given a graph G and a positive integer k. The objective is to test whether there exists a [1, j]-(total) dominating set of size at most k. The [1, j]-Dominating Set problem is known to be NP-complete, even for restricted classes of graphs such as chordal and planar graphs, but polynomial-time solvable on split graphs. The [1, 2]-Total Dominating Set problem is known to be NP-complete, even for bipartite graphs. As both problems generalize the Dominating Set problem, both are W[1]-hard when parameterized by solution size. In this work, we study [1, j]-Dominating Set on sparse graph classes from the perspective of parameterized complexity and prove the following results when the problem is parameterized by solution size: [1, j]-Dominating Set is W[1]-hard on d-degenerate graphs for d = j + 1; [1, j]-Dominating Set is FPT on nowhere dense graphs.
    [Show full text]
  • Lecture Beyond Planar Graphs 1 Overview 2 Preliminaries
    Approximation Algorithms Workshop June 17, 2011, Princeton Lecture Beyond Planar Graphs Erik Demaine Scribe: Siamak Tazari 1 Overview In the last lecture we learned about approximation schemes in planar graphs. In this lecture we go beyond planar graphs and consider bounded-genus graphs, and more generally, minor-closed graph classes. In particular, we discuss the framework of bidimensionality that can be used to obtain approximation schemes for many problems in minor-closed graph classes. Afterwards, we consider decomposition techniques that can be applied to other types of problems. The main motivation behind this line of work is that some networks are not planar but conform to some generalization of the concept of planarity, like being embeddable on a surface of bounded genus. Furthermore, by Kuratowski's famous theorem [Kur30], planarity can be characterized be excluding K5 and K3;3 as minors. Hence, it seems natural to study further classes with excluded minors as a generalization of planar graphs. One of the goals of this research is to identify the largest classes of graphs for which we can still ob- tain good and efficient approximations, i.e. to find out how far beyond planarity we can go. Natural candidate classes are graphs of bounded genus, graphs excluding a fixed minor, powers thereof, but also further generalizations, like odd-minor-free graphs, graphs of bounded expansion and nowhere dense classes of graphs. Another objective is to derive general approximation frameworks, two of which we are going to discuss here: bidimensionality and contraction decomposition. The main tools we are going to use come on one hand from graph structure theory and on the other hand from algorithmic results.
    [Show full text]