Sciweavers

CATS
2008
13 years 10 months ago
An ILP for the metro-line crossing problem
In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V, E) (e.g. the railroad network) and a set H of paths in...
Matthew Asquith, Joachim Gudmundsson, Damian Merri...
CATS
2008
13 years 10 months ago
Tractable Cases of the Extended Global Cardinality Constraint
We study the consistency problem for extended global cardinality (EGC) constraints. An EGC constraint consists of a set X of variables, a set D of values, a domain D(x) D for eac...
Marko Samer, Stefan Szeider
CATS
2008
13 years 10 months ago
Verifying Michael and Scott's Lock-Free Queue Algorithm using Trace Reduction
Lock-free algorithms have been developed to avoid various problems associated with using locks to control access to shared data structures. These algorithms are typically more int...
Lindsay Groves
CATS
2008
13 years 10 months ago
On the Non-existence of Even Degree Graphs with Diameter 2 and Defect 2
Using eigenvalue analysis, it was shown by Erd
Mirka Miller, Minh Hoang Nguyen, Guillermo Pineda-...
CATS
2008
13 years 10 months ago
The Core Concept for 0/1 Integer Programming
In this paper we examine an extension of the core concept for the 0/1 Multidimensional Knapsack Problem (MKP) towards general 0/1 Integer Programming (IP) by allowing negative pro...
Samuel Huston, Jakob Puchinger, Peter J. Stuckey
CATS
2008
13 years 10 months ago
Weak Parametric Failure Equivalences and Their Congruence Formats
Weak equivalences are important behavioral equivalences in the course of specifying and analyzing the reactive systems using process algebraic languages. In this paper, we propose...
Xiaowei Huang, Li Jiao, Weiming Lu
CATS
2008
13 years 10 months ago
The Inhabitation Problem for Intersection Types
In the system of intersection types, without , the problem as to whether an arbitrary type has an inhabitant, has been shown to be undecidable by Urzyczyn in [10]. For one subsys...
Martin W. Bunder
CATS
2008
13 years 10 months ago
Generating Balanced Parentheses and Binary Trees by Prefix Shifts
We show that the set Bn of balanced parenthesis strings with n left and n right parentheses can be generated by prefix shifts. If b1, b2, . . . , b2n is a member of Bn, then the k...
Frank Ruskey, Aaron Williams
CATS
2008
13 years 10 months ago
Well-covered Graphs and Greedoids
G is a well-covered graph provided all its maximal stable sets are of the same size (Plummer, 1970). S is a local maximum stable set of G, and we denote by S (G), if S is a maxim...
Vadim E. Levit, Eugen Mandrescu
CATS
2007
13 years 10 months ago
Computing a Minimum-Dilation Spanning Tree is NP-hard
Given a set S of n points in the plane, a minimumdilation spanning tree of S is a tree with vertex set S of smallest possible dilation. We show that given a set S of n points and ...
Otfried Cheong, Herman J. Haverkort, Mira Lee