Sciweavers

12 search results - page 2 / 3
» The Minimised Geometric Buchberger Algorithm: An Optimal Alg...
Sort
View
CCCG
2010
13 years 6 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...
COLOGNETWENTE
2010
13 years 1 months ago
A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
Stefano Gualandi, Francesco Maffioli, Claudio Magn...
DLOG
2010
13 years 3 months ago
Optimizing Algebraic Tableau Reasoning for SHOQ: First Experimental Results
In this paper we outline an algebraic tableau algorithm for the DL SHOQ, which supports more informed reasoning due to the use of semantic partitioning and integer programming. We ...
Jocelyne Faddoul, Volker Haarslev
ESA
2010
Springer
170views Algorithms» more  ESA 2010»
13 years 6 months ago
Streaming Graph Computations with a Helpful Advisor
Motivated by the trend to outsource work to commercial cloud computing services, we consider a variation of the streaming paradigm where a streaming algorithm can be assisted by a...
Graham Cormode, Michael Mitzenmacher, Justin Thale...
ESA
2003
Springer
90views Algorithms» more  ESA 2003»
13 years 10 months ago
Packing a Trunk
We report on a project with a German car manufacturer. The task is to compute (approximate) solutions to a specific large-scale packing problem. Given a polyhedral model of a car ...
Friedrich Eisenbrand, Stefan Funke, Joachim Reiche...