369 search results - page 12 / 74 » Approximation Algorithms for the Bi-criteria Weighted max-cu... |
100
click to vote
DAM
1999
14 years 11 months ago
1999
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...
JCO
2010
14 years 10 months ago
2010
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
141
click to vote
DCG
2010
14 years 11 months ago
2010
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
113
click to vote
FCT
2007
Springer
15 years 3 months ago
2007
Springer
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
149
click to vote
APPROX
2006
Springer
15 years 3 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...