Polynomial kernels for 3-leaf power graph modification problems

A graph G=(V,E) is a 3-leaf power iff there exists a tree T whose leaves are V and such that (u,v) is an edge iff u and v are at distance at most 3 in T. The 3-leaf power graph edge modification problems, i.e. edition (also known as the closest 3-leaf power), completion and edge-deletion, are FTP when parameterized by the size of the edge set modification. However polynomial kernel was known for none of these three problems. For each of them, we provide cubic kernels that can be computed in linear time for each of these problems. We thereby answer an open problem first mentioned by Dom, Guo, Huffner and Niedermeier (2005).Comment: Submitte

A structural approach to kernels for ILPs: Treewidth and Total Unimodularity

Kernelization is a theoretical formalization of efficient preprocessing for NP-hard problems. Empirically, preprocessing is highly successful in practice, for example in state-of-the-art ILP-solvers like CPLEX. Motivated by this, previous work studied the existence of kernelizations for ILP related problems, e.g., for testing feasibility of Ax <= b. In contrast to the observed success of CPLEX, however, the results were largely negative. Intuitively, practical instances have far more useful structure than the worst-case instances used to prove these lower bounds. In the present paper, we study the effect that subsystems with (Gaifman graph of) bounded treewidth or totally unimodularity have on the kernelizability of the ILP feasibility problem. We show that, on the positive side, if these subsystems have a small number of variables on which they interact with the remaining instance, then we can efficiently replace them by smaller subsystems of size polynomial in the domain without changing feasibility. Thus, if large parts of an instance consist of such subsystems, then this yields a substantial size reduction. We complement this by proving that relaxations to the considered structures, e.g., larger boundaries of the subsystems, allow worst-case lower bounds against kernelization. Thus, these relaxed structures can be used to build instance families that cannot be efficiently reduced, by any approach.Comment: Extended abstract in the Proceedings of the 23rd European Symposium on Algorithms (ESA 2015

Hitting forbidden subgraphs in graphs of bounded treewidth

We study the complexity of a generic hitting problem H-Subgraph Hitting, where given a fixed pattern graph $H$ and an input graph $G$, the task is to find a set $X \subseteq V(G)$ of minimum size that hits all subgraphs of $G$ isomorphic to $H$. In the colorful variant of the problem, each vertex of $G$ is precolored with some color from $V(H)$ and we require to hit only $H$-subgraphs with matching colors. Standard techniques shows that for every fixed $H$, the problem is fixed-parameter tractable parameterized by the treewidth of $G$; however, it is not clear how exactly the running time should depend on treewidth. For the colorful variant, we demonstrate matching upper and lower bounds showing that the dependence of the running time on treewidth of $G$ is tightly governed by $\mu(H)$, the maximum size of a minimal vertex separator in $H$. That is, we show for every fixed $H$ that, on a graph of treewidth $t$, the colorful problem can be solved in time $2^{\mathcal{O}(t^{\mu(H)})}\cdot|V(G)|$, but cannot be solved in time $2^{o(t^{\mu(H)})}\cdot |V(G)|^{O(1)}$, assuming the Exponential Time Hypothesis (ETH). Furthermore, we give some preliminary results showing that, in the absence of colors, the parameterized complexity landscape of H-Subgraph Hitting is much richer.Comment: A full version of a paper presented at MFCS 201

Parameterized Algorithms for Modular-Width

It is known that a number of natural graph problems which are FPT parameterized by treewidth become W-hard when parameterized by clique-width. It is therefore desirable to find a different structural graph parameter which is as general as possible, covers dense graphs but does not incur such a heavy algorithmic penalty. The main contribution of this paper is to consider a parameter called modular-width, defined using the well-known notion of modular decompositions. Using a combination of ILPs and dynamic programming we manage to design FPT algorithms for Coloring and Partitioning into paths (and hence Hamiltonian path and Hamiltonian cycle), which are W-hard for both clique-width and its recently introduced restriction, shrub-depth. We thus argue that modular-width occupies a sweet spot as a graph parameter, generalizing several simpler notions on dense graphs but still evading the "price of generality" paid by clique-width.Comment: to appear in IPEC 2013. arXiv admin note: text overlap with arXiv:1304.5479 by other author

Approximation Algorithms for the Capacitated Domination Problem

We consider the {\em Capacitated Domination} problem, which models a service-requirement assignment scenario and is also a generalization of the well-known {\em Dominating Set} problem. In this problem, given a graph with three parameters defined on each vertex, namely cost, capacity, and demand, we want to find an assignment of demands to vertices of least cost such that the demand of each vertex is satisfied subject to the capacity constraint of each vertex providing the service. In terms of polynomial time approximations, we present logarithmic approximation algorithms with respect to different demand assignment models for this problem on general graphs, which also establishes the corresponding approximation results to the well-known approximations of the traditional {\em Dominating Set} problem. Together with our previous work, this closes the problem of generally approximating the optimal solution. On the other hand, from the perspective of parameterization, we prove that this problem is {\it W[1]}-hard when parameterized by a structure of the graph called treewidth. Based on this hardness result, we present exact fixed-parameter tractable algorithms when parameterized by treewidth and maximum capacity of the vertices. This algorithm is further extended to obtain pseudo-polynomial time approximation schemes for planar graphs

PHYTOCHEMICAL SCREENING AND ANALYSIS POLYPHENOLIC ANTIOXIDANT ACTIVITY OF METHANOLIC EXTRACT OF WHITE DRAGON FRUIT (Hylocereus undatus)

White dragon fruit is a well known and widely used herbal medicine, especially in Asia, which contains several interesting bioactive constituents and possesses health promoting properties. The aim of this study was to analyze for the bioactive compounds, evaluate total phenolic contents and antioxidant capacities of methanolic extract of white dragon fruit. The antioxidant activity was determined by the 1,1-diphenyl-2-picrylhydrazyl (DPPH) free radical scavenging activity assay. Total phenolic content were determined by Folin-Ciocalteu method. Phytochemical screening of the white dragon fruit showed the presence of triterpenoid, alkaloid, flavonoid and saponin. The extract exhibited strong antioxidant activity with IC50 of 193 μg/mL, and total phenolic content of 246 μg/mL in 1 Kg dry extract

'In-ger-land, In-ger-land, In-ger-land! : exploring the impact of soccer on the sense of belonging of those seeking asylum in the UK

Utilising research conducted in Sheffield (UK) with people seeking asylum,this article explores the ways in which soccer might be used to create a sense of belonging in the host country. It explores participant feelings about soccer and its potential to alleviate the pressures that the status of being an ‘asylum seeker’ brings. The ways in which soccer may play a role in the identity formation of those seeking asylum is considered in relation to both self-identity and the perceptions of others. The findings of this exploratory study suggest that the various ways of interacting with soccer can provide participants with a sense of control, identity and belonging

Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter

An important result in the study of polynomial-time preprocessing shows that there is an algorithm which given an instance (G,k) of Vertex Cover outputs an equivalent instance (G',k') in polynomial time with the guarantee that G' has at most 2k' vertices (and thus O((k')^2) edges) with k' <= k. Using the terminology of parameterized complexity we say that k-Vertex Cover has a kernel with 2k vertices. There is complexity-theoretic evidence that both 2k vertices and Theta(k^2) edges are optimal for the kernel size. In this paper we consider the Vertex Cover problem with a different parameter, the size fvs(G) of a minimum feedback vertex set for G. This refined parameter is structurally smaller than the parameter k associated to the vertex covering number vc(G) since fvs(G) <= vc(G) and the difference can be arbitrarily large. We give a kernel for Vertex Cover with a number of vertices that is cubic in fvs(G): an instance (G,X,k) of Vertex Cover, where X is a feedback vertex set for G, can be transformed in polynomial time into an equivalent instance (G',X',k') such that |V(G')| <= 2k and |V(G')| <= O(|X'|^3). A similar result holds when the feedback vertex set X is not given along with the input. In sharp contrast we show that the Weighted Vertex Cover problem does not have a polynomial kernel when parameterized by the cardinality of a given vertex cover of the graph unless NP is in coNP/poly and the polynomial hierarchy collapses to the third level.Comment: Published in "Theory of Computing Systems" as an Open Access publicatio

Strange particle production in proton-proton collisions at s=0.9\sqrt{s}=0.9 TeV with ALICE at the LHC

The production of mesons containing strange quarks (K$^0_s$, $\phi$) and both singly and doubly strange baryons ($\Lambda$, Anti-$\Lambda$, and $\Xi$+Anti-$\Xi$) are measured at central rapidity in pp collisions at $\sqrt{s}$ = 0.9 TeV with the ALICE experiment at the LHC. The results are obtained from the analysis of about 250 k minimum bias events recorded in 2009. Measurements of yields (dN/dy) and transverse momentum spectra at central rapidities for inelastic pp collisions are presented. For mesons, we report yields () of 0.184 $\pm$ 0.002 stat. $\pm$ 0.006 syst. for K$^0_s$ and 0.021 $\pm$ 0.004 stat. $\pm$ 0.003 syst. for $\phi$. For baryons, we find = 0.048 $\pm$ 0.001 stat. $\pm$ 0.004 syst. for $\Lambda$, 0.047 $\pm$ 0.002 stat. $\pm$ 0.005 syst. for Anti-$\Lambda$ and 0.0101 $\pm$ 0.0020 stat. $\pm$ 0.0009 syst. for $\Xi$+Anti-$\Xi$. The results are also compared with predictions for identified particle spectra from QCD-inspired models and provide a baseline for comparisons with both future pp measurements at higher energies and heavy-ion collisions.Comment: 33 pages, 21 captioned figures, 10 tables, authors from page 28, published version, figures at http://aliceinfo.cern.ch/ArtSubmission/node/387