Sciweavers

2314 search results - page 294 / 463
» Minimal Partitions of a Graph
Sort
View
IJCGA
2008
132views more  IJCGA 2008»
15 years 4 months ago
Constructing the City Voronoi Diagram Faster
Given a set S of n point sites in the plane, the City Voronoi diagram partitions the plane into the Voronoi regions of the sites, with respect to the City metric. This metric is i...
Robert Görke, Chan-Su Shin, Alexander Wolff
EOR
2006
83views more  EOR 2006»
15 years 4 months ago
Lower bounds and heuristic algorithms for the k
We consider the problem of partitioning a set of positive integers values into a given number of subsets, each having an associated cardinality limit, so that the maximum sum of v...
Mauro Dell'Amico, Manuel Iori, Silvano Martello, M...
CSDA
2007
142views more  CSDA 2007»
15 years 4 months ago
DIVCLUS-T: A monothetic divisive hierarchical clustering method
DIVCLUS-T is a divisive hierarchical clustering algorithm based on a monothetic bipartitional approach allowing the dendrogram of the hierarchy to be read as a decision tree. It i...
Marie Chavent, Yves Lechevallier, Olivier Briant
RP
2010
Springer
133views Control Systems» more  RP 2010»
15 years 2 months ago
Behavioral Cartography of Timed Automata
We aim at finding a set of timing parameters for which a given timed automaton has a “good” behavior. We present here a novel approach based on the decomposition of the parame...
Étienne André, Laurent Fribourg
ECCC
2007
147views more  ECCC 2007»
15 years 3 months ago
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswa...