Violator Spaces: Structure and Algorithms

Sharir and Welzl introduced an abstract framework for optimization problems, called LP-type problems or also generalized linear programming problems, which proved useful in algorithm design. We define a new, and as we believe, simpler and more natural framework: violator spaces, which constitute a proper generalization of LP-type problems. We show that Clarkson's randomized algorithms for low-dimensional linear programming work in the context of violator spaces. For example, in this way we obtain the fastest known algorithm for the P-matrix generalized linear complementarity problem with a constant number of blocks. We also give two new characterizations of LP-type problems: they are equivalent to acyclic violator spaces, as well as to concrete LP-type problems (informally, the constraints in a concrete LP-type problem are subsets of a linearly ordered ground set, and the value of a set of constraints is the minimum of its intersection).Comment: 28 pages, 5 figures, extended abstract was presented at ESA 2006; author spelling fixe

The tropical shadow-vertex algorithm solves mean payoff games in polynomial time on average

We introduce an algorithm which solves mean payoff games in polynomial time on average, assuming the distribution of the games satisfies a flip invariance property on the set of actions associated with every state. The algorithm is a tropical analogue of the shadow-vertex simplex algorithm, which solves mean payoff games via linear feasibility problems over the tropical semiring $(\mathbb{R} \cup \{-\infty\}, \max, +)$. The key ingredient in our approach is that the shadow-vertex pivoting rule can be transferred to tropical polyhedra, and that its computation reduces to optimal assignment problems through Pl\"ucker relations.Comment: 17 pages, 7 figures, appears in 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part

On rr-Simple kk-Path

An $r$-simple $k$-path is a {path} in the graph of length $k$ that passes through each vertex at most $r$ times. The $r$-SIMPLE $k$-PATH problem, given a graph $G$ as input, asks whether there exists an $r$-simple $k$-path in $G$. We first show that this problem is NP-Complete. We then show that there is a graph $G$ that contains an $r$-simple $k$-path and no simple path of length greater than $4\log k/\log r$. So this, in a sense, motivates this problem especially when one's goal is to find a short path that visits many vertices in the graph while bounding the number of visits at each vertex. We then give a randomized algorithm that runs in time $$\mathrm{poly}(n)\cdot 2^{O( k\cdot \log r/r)}$$ that solves the $r$-SIMPLE $k$-PATH on a graph with $n$ vertices with one-sided error. We also show that a randomized algorithm with running time $\mathrm{poly}(n)\cdot 2^{(c/2)k/ r}$ with $c<1$ gives a randomized algorithm with running time \poly(n)\cdot 2^{cn} for the Hamiltonian path problem in a directed graph - an outstanding open problem. So in a sense our algorithm is optimal up to an $O(\log r)$ factor

Algorithmic Analysis of Array-Accessing Programs

For programs whose data variables range over Boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. In this paper, we consider algorithmic verification of programs that use Boolean variables, and in addition, access a single array whose length is potentially unbounded, and whose elements range over pairs from Σ × D, where Σ is a finite alphabet and D is a potentially unbounded data domain. We show that the reachability problem, while undecidable in general, is (1) Pspace-complete for programs in which the array-accessing for-loops are not nested, (2) solvable in Ex-pspace for programs with arbitrarily nested loops if array elements range over a finite data domain, and (3) decidable for a restricted class of programs with doubly-nested loops. The third result establishes connections to automata and logics defining languages over data words

Finding and counting vertex-colored subtrees

The problems studied in this article originate from the Graph Motif problem introduced by Lacroix et al. in the context of biological networks. The problem is to decide if a vertex-colored graph has a connected subgraph whose colors equal a given multiset of colors $M$. It is a graph pattern-matching problem variant, where the structure of the occurrence of the pattern is not of interest but the only requirement is the connectedness. Using an algebraic framework recently introduced by Koutis et al., we obtain new FPT algorithms for Graph Motif and variants, with improved running times. We also obtain results on the counting versions of this problem, proving that the counting problem is FPT if M is a set, but becomes W[1]-hard if M is a multiset with two colors. Finally, we present an experimental evaluation of this approach on real datasets, showing that its performance compares favorably with existing software.Comment: Conference version in International Symposium on Mathematical Foundations of Computer Science (MFCS), Brno : Czech Republic (2010) Journal Version in Algorithmic

Unhappiness and Job Finding

It is puzzling that people feel unhappy when they become unemployed, while simultaneously active labour market policies are needed to bring them back to work. We investigate this using GSOEP data. We find that nearly half of the unemployed do not experience a drop in happiness, which might explain why activation is sometimes needed. Furthermore, even though unhappy unemployed search more actively for a job, it does not speed up their job finding. Apparently, there is no link between unhappiness and job finding rate. Hence there is no contradiction between the unemployed being unhappy and the need for activation policies

A systematic review of randomised controlled trials on the effectiveness of exercise programs on lumbo pelvic pain among postnatal women

Background: A substantial number of women tend to be affected by Lumbo Pelvic Pain (LPP) following child birth. Physical exercise is indicated as a beneficial method to relieve LPP, but individual studies appear to suggest mixed findings about its effectiveness. This systematic review aimed to synthesise evidence from randomised controlled trials on the effectiveness of exercise on LPP among postnatal women to inform policy, practice and future research. Methods: A systematic review was conducted of all randomised controlled trials published between January 1990 and July 2014, identified through a comprehensive search of following databases: PubMed, PEDro, Embase, Cinahl, Medline, SPORTDiscus, Cochrane Pregnancy and Childbirth Group’s Trials Register, and electronic libraries of authors’institutions. Randomised controlled trials were eligible for inclusion if the intervention comprised of postnatal exercise for women with LPP onset during pregnancy or within 3 months after delivery and the outcome measures included changes in LPP. Selected articles were assessed using the PEDro Scale for methodological quality and findings were synthesised narratively as meta-analysis was found to be inappropriate due to heterogeneity among included studies. Results: Four randomised controlled trials were included, involving 251 postnatal women. Three trials were rated as of ‘good’ methodological quality. All trials, except one, were at low risk of bias. The trials included physical exercise programs with varying components, differing modes of delivery, follow up times and outcome measures. Intervention in one trial, involving physical therapy with specific stabilising exercises, proved to be effective in reducing LPP intensity. An improvement in gluteal pain on the right side was reported in another trial and a significant difference in pain frequency in another. Conclusion: Our review indicates that only few randomised controlled trials have evaluated the effectiveness of exercise on LPP among postnatal women. There is also a great amount of variability across existing trials in the components of exercise programs, modes of delivery, follow up times and outcome measures. While there is some evidence to indicate the effectiveness of exercise for relieving LPP, further good quality trials are needed to ascertain the most effective elements of postnatal exercise programs suited for LPP treatment