Practical Safety in Flexible Access Control Models

ACM Transactions on Information and System Security

Volumn 4, Issue 2, 2001, Pages 158-190

  Jaeger, Trent ^a   Tidswell, Jonathon E ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Access control; Access control models; Authorization mechanisms; Design; Management; Role Based; Security

Indexed keywords

EID: 85006937063     PISSN: 10949224     EISSN: 15577406     Source Type: Journal    
DOI: 10.1145/501963.501966     Document Type: Article

References (39)

1. Agrawal, A., Klein, P., and Ravi, R. 1995. When trees collide: An approximation algorithm for the generalized Steiner problem on networks, SIAM J. Comput. 24, 3, 445-456.
2. Arata, K., Iwata, S., Makino, K., and FUJISHIGE, S. 2000. Source location: Locating sources to meet flow demands in undirected networks. In Proceedings of SWAT 2000.
3. Arora, S., and Lund, C. 1996. Hardness of approximations. In Approximation Algorithms for NP-hard Problems, Dorit Hochbaum, Ed. PWS Publishing.
4. Bartal, Y. 1998. On approximating arbitrary metrics by tree metrics. In Proceedings of the Symposium on Theory of Computing. ACM, New York.
5. Blum, A., Ravi, R., and Vempala, S. 1999. A constant-factor approximation algorithm for the k-MST Problem. J. Comput. Syst. Sci. 58, 101-108.
6. Charikar, M., Chekuri, C., Cheung, T, Dai, Z., Goel, A., Guha, S., and Li, M. 1999. Approximation algorithms for directed Steiner problems. J. Alg. 33, 73-91.
7. Charikar, M., Chekuri, C., Goel, A. Guha, S., and Plotkin, S. 1998. Approximating a finite metric by small number of trees. In Proceedings of the Symposium on Foundations of Computer Scince. IEEE Computer Society Press, Los Alamitos, Calif.
8. Chudak, F., Roughgarden, T, and Williamson, D. 2001. Approximate k-MSTs and k-Steiner trees via the primal-dual method and lagrangean Relaxation. In IPCO, pp. 60-70.
9. Crainic, T. G., Frangioni, A., and Gendron, B. 2001. Bundle-based relaxation methods for multicommodity capacitated fixed charge network design problems. Disc. Appl. Math. 112, 73-99.
10. Di Gaspero, L., Gärtner, J., Kortsarz, G., Musliu, N., Schaerf, A., and Slany, W. 2003. The minimum shift design problem: Theory and practice. In Proceedings of the European Symposium on Algorithms (ESA), pp. 593-604.
11. Diestel, R. 2000. Graph theory, 2nd Ed. Springer-Verlag, New York, URL: http://www.math.uni-hamburg.de/home/diestel/books/graph.theory/.
12. Equi, L., Gallo, G., Marziale, S., and Weintraub, A. 1997. A combined transportation and scheduling problem. Europ. J. Oper. Res. 97, 1, 94-104.
13. Fetterolf, P. C., and Anandalingam, G. 1992. A Lagrangian relaxation technique for optimizing interconnection of local area networks. Oper. Res. 40, 4, 678-688.
14. Garey, M. R., and Johnson, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company.
15. Garg, N. 1996. A 3-approximation for minimum spanning tree spanning k vertices. In Proceedings of the 37th Symposium on Foundation of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 302-309.
16. Garg, N., Konjevod, G., and Ravi, R. 2000. A polylogarithmic approximation algorithm for the group Steiner tree problem. J. Algor. 37, 1, 66-84.
17. Gendron, B., and Crainic, T. G. 1996. Bounding procedures for multicommodity capacitated fixed charge network design problems. Publication CRT-96-06, Centre de recherche sur les transports, Universite de Montreal, Montreal, Ont., Canada.
18. Goemans, M. X., and Williamson, D. p. 1997. The primal-dual method for approximation algorithms and its application to network design problems. In Approximation Algorithms, D. Hochbaum, Ed. PWS Publishing Company, pp. 114-191.
19. Goethe-Lundgren, M., and Larsson, T. 1994. A set covering reformulation of the pure fixed charge transportation problem. Discrete Appl. Math. 48, 3, 245-259.
20. Hochbaum, D. S., and Segev, A. 1989. Analysis of a flow problem with fixed charges. Networks 19, 3, 291-312.
21. Holmberg, K., and Yuan, D. 1997. A Lagrangean heuristic-based branch-and-bound approach for the capacitated network design problem. In Proceedings of the 4th Meeting of the Nordic Section of the Mathematical Programming Society (Arhus, Denmark, Aug. 16-18).
22. Kim Allan Andersen ed., Univ. of Arhus, Department of Operations Research, Publications at the Departments of Mathematical Sciences. Working Papers 97-1, pp. 62-97.
23. Johnson, D. S. 1974. Approximation algorithms for combinatorial problems. J. Comput. System Sci. 9, 256-278.
24. Kim, D., and Pardalos, P. M. 1999. A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Oper. Res. Lett. 24, 4, 195-203.
25. Konjevod, G., and Ravi, R. 2000. An approximation algorithm for the covering Steiner problem. In Proceedings of the 11th ACM/SIAM Symposium on Discrete Algorithms (Jan.). ACM, New York, pp. 334-338.
26. Konjevod, G., Ravi, R., and Srinivasan, A. 2002. Approximation algorithms for the covering Steiner problem. Rand. Struct. Algorithms 20, 3, 465-482.
27. Kortsarz, G. 1998. On the hardness of approximating spanners. In Proceedings of the 1st International Workshop (Approx-98). pp. 135-146.
28. Kortsarz, G., and Peleg, D. 1999. Approximating the weight of shallow Steiner trees. Disc. Appl. Math. 93, 265-285.
29. Krumke, S. O., Noltemeier, H., Schwarz, S., Wirth, H.-C., and Ravi, R. 1998. Flow improvement and network flows with fixed costs. OR-98, Zürich.
30. Lau, H. C. 1996. Combinatorial approaches for hard problems in manpower scheduling. J. Oper. Res. Soc. Japan 39, 1, 88-98.
31. Leiserson, C. E., and Saxe, J. B. 1991. Retiming synchronous circuitry. Algorithmica 6, 1, 5-35.
32. LI, C. L., Mccormick, S. T., and Simchi-Levi, D. 1992. The point-to-point delivery and connection problems: Complexity and algorithms. Disc. Appl. Math. 36, 267-292.
33. Magnanti, T. L., and Wong, R. T. 1984. Network design and transportation planning: Models and algorithms. Transport. Sci. 18, 1-55.
34. Magnanti, T. L., Mireault, P., and wong, R. T. 1986. Tailoring benders decomposition for uncapacitated network design. Math. Program. Study 26, 112-154.
35. Motwani, R., and Raghavan, P. 1995. Randomized Algorithms. Cambridge University Press, Cambridge, Mass.
36. Ravi, R., Sundaram, R., Marathe, M. V., Rosenkrantz, D. J., and Ravi, S. S. 1996. Spanning trees short or small. SIAM J. Disc. Math. 9, 2, 178-200.
37. Raz, R. 1995. A parallel repetition theorem. In Proceedings of the 27th ACM Symposium on the Theory of Computing. ACM, New York, 447-456.
38. Full version in SIAM J. Comput. 27, 3, 763-803, 1998.
39. Wolsey, L. A. 1982. An analysis of the greedy algorithm for the submodular set covering problem.