117
click to vote
ALGORITHMICA
2016
10 years 15 days ago
2016
We study the problem of designing a data structure that reports the positions of the distinct τ-majorities within any range of an array A[1, n], without storing A. A τ-majority ...
138
click to vote
ALGORITHMICA
2016
10 years 15 days ago
2016
Abstract. In the (parameterized) Ordered List Subgraph Embedding problem (p-OLSE) we are given two graphs G and H, each with a linear order defined on its vertices, a function L t...
205
click to vote
ALGORITHMICA
2016
10 years 15 days ago
2016
The class q-Horn, introduced by Boros, Crama and Hammer in 1990, is one of the largest known classes of propositional CNF formulas for which satisfiability can be decided in poly...
135
click to vote
ALENEX
2016
10 years 15 days ago
2016
We consider the problem of Pareto-optimal route planning in public-transit networks of a whole country, a whole continent, or even the whole world. On such large networks, existin...
222
click to vote
ALENEX
2016
10 years 15 days ago
2016
Exploiting geometric structure to improve the asymptotic complexity of discrete assignment problems is a well-studied subject. In contrast, the practical advantages of using geome...
151
click to vote
AI
2016
Springer
10 years 15 days ago
2016
Springer
We discuss a new implementation of, and new experiments with, Fajtlowicz’s Dalmatian conjecture-making heuristic. Our program makes conjectures about relations of real number in...
262
click to vote
AI
2016
Springer
10 years 15 days ago
2016
Springer
In the Complete Set Partitioning problem we are given a finite set of elements where every subset is associated with a nd the goal is to partition this set into disjoint subsets ...
170
click to vote
AI
2016
Springer
10 years 15 days ago
2016
Springer
The standard way of answering queries over incomplete databases is to compute certain answers, defined as the intersection of query answers on all complete databases that the inc...