296 search results - page 18 / 60 » Approximation Algorithms for Requirement Cut on Graphs |
108
click to vote
TCC
2012
Springer
13 years 5 months ago
2012
Springer
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
106
click to vote
NETWORKS
2002
14 years 9 months ago
2002
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
AAAI
2012
13 years 3 hour ago
2012
Widespread accounts of the harmful effects of invasive species have stimulated both practical and theoretical studies on how the spread of these destructive agents can be containe...
105
click to vote
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
PG
2007
IEEE
15 years 3 months ago
2007
IEEE
This paper presents a novel PRT-based method that uses precomputed visibility cuts for interactive relighting with all-frequency environment maps and arbitrary dynamic BRDFs. Our ...