1389 search results - page 54 / 278 » Improved Approximation Algorithms for Label Cover Problems |
118
click to vote
MP
2007
15 years 2 months ago
2007
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
114
Voted
JPDC
2007
15 years 2 months ago
2007
We study the problem of scheduling unit size jobs on n processors connected by a ring. We show a distributed algorithm for this problem with an approximation ratio of 3 2 + √ 2....
122
Voted
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
135
Voted
ESA
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
111
click to vote
WADS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...