648 search results - page 14 / 130 » Simple Algorithms for a Weighted Interval Selection Problem |
CATS
2006
13 years 9 months ago
2006
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
IEICET
2011
13 years 2 months ago
2011
In this paper, we study the minimum spanning tree problem for vertex-labeled graphs, where the weights of edges may vary depending on the selection of labels of vertices at both e...
CEC
2009
IEEE
13 years 11 months ago
2009
IEEE
Evolutionary algorithms have employed the SAW (Stepwise Adaptation of Weights) method in order to solve CSPs (Constraint Satisfaction Problems). This method originated in hill-clim...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract—In this contribution, we propose an original algorithm for self-localization in mobile ad-hoc networks. The proposed technique, based on interval analysis, is suited to ...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...