626 search results - page 38 / 126 » On Approximability of Minimum Bisection Problem |
134
Voted
CIAC
2006
Springer
15 years 4 months ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
113
click to vote
ICPR
2010
IEEE
15 years 5 months ago
2010
IEEE
This paper introduces a geometrically inspired large-margin classifier that can be a better alternative to the Support Vector Machines (SVMs) for the classification problems with ...
157
Voted
OL
2011
14 years 7 months ago
2011
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
90
Voted
IPL
2007
15 years 16 days ago
2007
Given an edge-weighted graph G = (V,E), a subset S ⊆ V , an integer k 1 and a real b 0, the minimum subpartition problem asks to find a family of k nonempty disjoint subsets X1...
109
Voted
MOBIHOC
2010
ACM
14 years 10 months ago
2010
ACM
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...