142 search results - page 14 / 29 » Approximate maximum weight branchings |
103
Voted
CORR
2006
Springer
15 years 1 months ago
2006
Springer
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...
ESA
2009
Springer
15 years 8 months ago
2009
Springer
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
: We extend Goldie's (1991) Implicit Renewal Theorem to enable the analysis of recursions on weighted branching trees. We illustrate the developed method by deriving the power...
135
click to vote
ALGORITHMICA
1998
15 years 1 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
106
Voted
APPROX
2007
Springer
15 years 8 months 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 ...