Sciweavers

Share
IPL
2007
114views more  IPL 2007»
8 years 8 months ago
Spanning trees with minimum weighted degrees
Given a metric graph G, we are concerned with ļ¬nding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...
Mohammad Ghodsi, Hamid Mahini, Kian Mirjalali, Sha...
JAL
2008
97views more  JAL 2008»
8 years 8 months ago
Experimental studies of variable selection strategies based on constraint weights
An important class of heuristics for constraint satisfaction problems works by sampling information during search in order to inform subsequent decisions. One of these strategies, ...
Richard J. Wallace, Diarmuid Grimes
DM
2008
68views more  DM 2008»
8 years 8 months ago
Heavy cycles in k-connected weighted graphs with large weighted degree sums
A weighted graph is one in which every edge e is assigned a nonnegative number w(e), called the weight of e. The weight of a cycle is defined as the sum of the weights of its edge...
Bing Chen, Shenggui Zhang, T. C. Edwin Cheng
APPROX
2008
Springer
137views Algorithms» more  APPROX 2008»
8 years 10 months ago
Approximating Directed Weighted-Degree Constrained Networks
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...
Zeev Nutov
books