133 search results - page 19 / 27 » Approximating the Minimum Weight Triangulation |
CORR
2008
Springer
13 years 6 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
SSS
2009
Springer
14 years 1 months ago
2009
Springer
We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximati...
PVLDB
2010
13 years 5 months ago
2010
This paper introduces a new definition of dense subgraph pattern, the DN-graph. DN-graph considers both the size of the sub-structure and the minimum level of interactions betwee...
APPROX
2007
Springer
14 years 27 days ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
APPROX
2008
Springer
13 years 8 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...