133 search results - page 12 / 27 » Approximating the Minimum Weight Triangulation |
153
click to vote
COCOON
2004
Springer
15 years 7 months ago
2004
Springer
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirement...
115
click to vote
SODA
1997
ACM
15 years 4 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
143
Voted
TAMC
2009
Springer
15 years 10 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
124
click to vote
ICPR
2004
IEEE
16 years 4 months ago
2004
IEEE
A normalized, power-weighted averaging filter (NPF) is a very good approximation to the well-know local maximum and minimum filters along the object edges and offers noise reducti...
184
Voted
OL
2011
14 years 10 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...