Abstract
References
Index Terms
- Tree resolution and generalized semantic tree
Recommendations
Generalised k-Steiner Tree Problems in Normed Planes
The 1-Steiner tree problem, the problem of constructing a Steiner minimum tree containing at most one Steiner point, has been solved in the Euclidean plane by Georgakopoulos and Papadimitriou using plane subdivisions called oriented Dirichlet cell ...
CTL-RP: A computation tree logic resolution prover
Practical Aspects of Automated ReasoningIn this paper, we present a resolution-based calculus R CTL >,S for Computation Tree Logic (CTL) as well as an implementation of that calculus in the theorem prover CTL-RP. The calculus R CTL >,S requires a transformation of an arbitrary CTL formula to ...
Approximating the selected-internal Steiner tree
In this paper, we consider a variant of the well-known Steiner tree problem. Given a complete graph G=(V,E) with a cost function c:E->R^+ and two subsets R and R^' satisfying R^'@?R@?V, a selected-internal Steiner tree is a Steiner tree which contains (...
Comments
Information & Contributors
Information
Published In
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Article
Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 489Total Downloads
- Downloads (Last 12 months)118
- Downloads (Last 6 weeks)10
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in