4131 search results - page 190 / 827 » The Generalized Max-Controlled Set Problem |
137
Voted
CIAC
2010
Springer
16 years 1 months ago
2010
Springer
Given an arbitrary graph G = (V, E) and an additional set of admissible edges F, the Chordal Sandwich problem asks whether there exists a chordal graph (V, E F ) such that F F. ...
119
Voted
SODA
2008
ACM
15 years 5 months ago
2008
ACM
This paper studies an extension of the k-median problem where we are given a metric space (V, d) and not just one but m client sets {Si V }m i=1, and the goal is to open k facili...
146
Voted
TCS
2010
15 years 2 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
97
Voted
ICALT
2008
IEEE
15 years 10 months ago
2008
IEEE
Although the notion of generality is central in mathematics and science, being able to identify and express general patterns and/or articulating structures is one of the main difï...
126
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...