393 search results - page 32 / 79 » Approximation Algorithm for Directed Telephone Multicast Pro... |
AAIM
2005
Springer
15 years 3 months ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
WG
2007
Springer
15 years 3 months ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
102
click to vote
STOC
2010
ACM
15 years 2 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
73
Voted
AI
2010
Springer
14 years 9 months ago
2010
Springer
instruments. A melody expresses abstract artistic conception or emotion. The explanation ability plays the key role in the externalization and internalization from one form of expr...
103
click to vote
CORR
2008
Springer
14 years 9 months ago
2008
Springer
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...