Searching for "All-Termination(T)." – sorted by Relevance.
9 documents found, showing 1 through 9.
-
An improved approximation algorithm for the 0-extension problem
- …0, and D(t, t) = 0 for all terminals t.In this case the problem amounts to minimizing the sum…
- Cited by 14 (2 self) – Add To MetaCart
-
Approximation algorithms for the 0-extension problem
- … to functions f : V → T which are arbitrary except for the constraint that f(t) = t for all terminals t…
- Cited by 37 (3 self) – Add To MetaCart
-
Network Design for Vertex Connectivity
- …(p) and the other endpoint lies on the prefix p(f). All terminals t(p) for p ∈ R(f) are distinct. P3. For each p ∈ R…
- Cited by 2 (2 self) – Add To MetaCart
-
Efficient Graph-Based Energy Minimization Methods In Computer Vision
- … to all terminals by t-links (some of the t-links are omitted from the drawing for legibility). The set…
- Cited by 38 (2 self) – Add To MetaCart
-
Energy Minimization with Discontinuities
- … has an n-link to its four neighbors. Each pixel is also connected to all terminals by t-links (some…
- Cited by 6 (0 self) – Add To MetaCart
-
Generic Reliability Trust Model
- … an s, tpath in GS Source-to-all-terminal ∀t ∈ V (G) − s, there exists an s, tpath in GS The reliability…
- Add To MetaCart
-
Approximating the Performance of Stochastic Distribution Systems
- …(x) = i =1 m p i,j i . (2.1) Let D denote those edges, all terminating at t, associated with demand…
- Add To MetaCart
-
unknown title
- … terminate at t--this can be easily computed, even for general directed graphs. Then, if the path is picked…
- Add To MetaCart
-
How to pay, come what may: Approximation algorithms for demand-robust covering problems
- … set of terminals {t k 1,t k 2,...}. sol(Sk) is the set of all edge sets that connect all terminals {t…
- Cited by 11 (2 self) – Add To MetaCart
Showing 1 through 9.
