4843 search results - page 358 / 969 » The Shortcut Problem - Complexity and Approximation |
150
click to vote
SIAMCOMP
2010
15 years 2 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
135
click to vote
ALDT
2009
Springer
15 years 11 months ago
2009
Springer
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...
100
Voted
SOFSEM
2004
Springer
15 years 9 months ago
2004
Springer
We initiate a systematic study of the Row Deletion(B) problem on matrices: For a fixed “forbidden submatrix” B, the question is, given an input matrix A (both A and B have ent...
110
click to vote
JMMA
2002
15 years 4 months ago
2002
Abstract. Multiresolution representation of quadrilateral surface approximation (MRQSA) is a useful representation for progressive graphics transmission in networks. Based on two r...
122
click to vote
ICASSP
2011
IEEE
14 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...