796 search results - page 113 / 160 » The Anonymous Subgraph Problem |
RC
2007
14 years 11 months ago
2007
This paper develops easily computed, tight bounds on Generalized Linear Predictors and instrumental variable estimators when outcome data are partially identi…ed. A salient exam...
MST
2007
14 years 11 months ago
2007
Consider a collection of r identical asynchronous mobile agents dispersed on an arbitrary anonymous network of size n. The agents all execute the same protocol and move from node ...
110
click to vote
P2P
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract--When a host discovers that it has a software vulnerability that is susceptible to an attack, the host needs to obtain and install a patch. Because centralized distributio...
102
click to vote
ICALP
2009
Springer
16 years 5 days ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
ESA
2005
Springer
15 years 5 months ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...