2137 search results - page 177 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
168
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
135
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
Given an edge-weighted undirected graph G with a specified set of terminals, let the density of any subgraph be the ratio of its weight/cost to the number of terminals it contain...
169
click to vote
CCCG
1998
15 years 7 months ago
1998
Given a set P of n points in Rd, a fundamental problem in computational geometry is concerned with finding the smallest shape of some type that encloses all the points of P. Well-...
95
Voted
CDC
2008
IEEE
16 years 25 days ago
2008
IEEE
— Motivated by some crowd motion models in the presence of noise, we consider an optimal control problem governed by the Fokker-Planck equation. We sketch optimality conditions b...
186
click to vote
COCOON
2003
Springer
15 years 11 months ago
2003
Springer
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...