1132 search results - page 155 / 227 » Upper and lower Ramsey bounds in bounded arithmetic |
164
click to vote
CAS
2008
15 years 6 months ago
2008
In this paper we first present a novel approach to determine the structural information content (graph entropy) of a network represented by an undirected and connected graph. Such...
170
click to vote
EOR
2010
15 years 6 months ago
2010
In this work we study the Capacitated p-Center Problem (CpCP) and we propose an exact algorithm to solve it. We study two auxiliary problems and their relation to CpCP, and we pro...
174
click to vote
ADCM
2006
15 years 6 months ago
2006
Barycentric coordinates are unique for triangles, but there are many possible generalizations to convex polygons. In this paper we derive sharp upper and lower bounds on all baryc...
152
click to vote
IJCGA
2006
15 years 6 months ago
2006
This paper introduces a new notion related to the traveling salesperson problem (TSP) -the notion of the TSP ratio. The TSP ratio of a TSP instance I is the sum of the marginal va...
154
click to vote
JOC
2006
15 years 6 months ago
2006
We study the role of connectivity of communication networks in private computations under information theoretic settings. It will be shown that some functions can be computed by pr...