25 search results - page 1 / 5 » Approximation algorithms via contraction decomposition |
COMBINATORICA
2010
12 years 11 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
CIA
2008
Springer
13 years 6 months ago
2008
Springer
This paper presents a specific contracting algorithm that contributes to the process of distributed planning and resource allocation in competitive, semi-trusted environments. The ...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
CVPR
2010
IEEE
14 years 1 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
This paper deals with the minimal polyadic decomposition (also known as canonical decomposition or Parafac) of a 3way array, assuming each entry is positive. In this case, the low...