1469 search results - page 193 / 294 » Approximate polynomial decomposition |
166
click to vote
ESA
2005
Springer
15 years 12 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...
159
click to vote
ESA
2003
Springer
15 years 11 months ago
2003
Springer
In ad-hoc wireless networks, certain network connectivity constraints are of interest because of their practical importance. An example of such a constraint would be strong connec...
175
click to vote
WINE
2009
Springer
15 years 11 months ago
2009
Springer
We consider the complexity of decision making with regards to predatory pricing in multimarket oligopoly models. Specifically, we present multimarket extensions of the classical s...
219
click to vote
DCOSS
2008
Springer
15 years 8 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
179
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...