14165 search results - page 179 / 2833 » The generalized two-server problem |
130
click to vote
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
127
click to vote
TIT
2008
15 years 4 months ago
2008
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
98
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We explore the intricate interdependent relationship among counting problems, considered from three frameworks for such problems: Holant Problems, counting CSP and weighted H-color...
127
click to vote
MP
2006
15 years 4 months ago
2006
In this paper we introduce a new class of facet-inducing inequalities for the Windy Rural Postman Problem and the Windy General Routing Problem. These inequalities are called Zigz...
141
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...