681 search results - page 21 / 137 » General Polynomial Time Decomposition Algorithms |
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
98
Voted
CORR
2010
Springer
15 years 20 days ago
2010
Springer
The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduce the notion of A-covered codes, that is...
107
Voted
WG
2005
Springer
15 years 6 months ago
2005
Springer
The Tutte polynomial is a notoriously hard graph invariant, and efficient algorithms for it are known only for a few special graph classes, like for those of bounded tree-width. Th...
COMPGEOM
2004
ACM
15 years 6 months ago
2004
ACM
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
103
Voted
JSC
2010
14 years 11 months ago
2010
We prove two versions of Stickelberger’s Theorem for positive dimensions and use them to compute the connected and irreducible components of a complex algebraic variety. If the ...