Reachability under uncertainty

Proceedings of the 23rd Conference on Uncertainty in Artificial Intelligence, UAI 2007

Volumn , Issue , 2007, Pages 41-48

  Chang, Allen ^a   Amir, Eyal ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED ACYCLIC GRAPHS; EFFICIENT APPROXIMATION ALGORITHMS; EXACT ALGORITHMS; FAILURE PROBABILITY; HIDDEN VARIABLE; MINIMUM COST; NETWORK REACHABILITY; NP-HARDNESS; REACHABILITY; SHORTEST PATH PROBLEM; THEORETICAL RESULT;

ARTIFICIAL INTELLIGENCE; PROBABILITY;

APPROXIMATION ALGORITHMS;

EID: 80053211669     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. De Loera, J.; Hemmecke, R.; Onn, S.; Rothblum, U. G.; and Weismantel, R. (2006). "Integer Convex Maximization". ArXiv Mathematics e-prints.
2. Ergun, F.; Sinha, R.; and Zhang, L. (2002). "An improved FPTAS for restricted shortest path". Inf. Process. Lett., 83(5), pp. 287-291. (Pubitemid 34704436)
3. F. A. Kuipers, T. Korkmaz, M. K. and Mieghem, P. V. (2002). "Overview of constraint-based path selection algorithms for QoS routing". IEEE Commun. Mag., 40(12), pp. 50-55.
4. Grimmett, G. (1989). "Percolation".
5. Hassin, R. (1992). "Approximation schemes for the restricted shortest path problem". Math. Oper. Res., 17(1), pp. 36-42.
6. Horst, R.; Pardalos, P. M.; and Thoai, N. V. (2000). Introduction to Global Optimization. Kluwer Academic Publishers, Dordrecht, The Netherlands.
7. Lorenz, D. and Raz, D. (1999). "A simple efficient approximation scheme for the restricted shortest paths problem".
8. Loui, R. P. (1983). "Optimal paths in graphs with stochastic or multidimensional weights". Commun. ACM, 26(9), pp. 670-676.
9. Marathe, M. V.; Ravi, R.; Sundaram, R.; Ravi, S. S.; Rosenkrantz, D. J.; and Harry B. Hunt, I. (1998). "Bicriteria network design problems". J. Algorithms, 28(1), pp. 142-171. (Pubitemid 128638752)
10. Nikolova, E.; Kelner, J. A.; Brand, M.; and Mitzenmacher, M. (2006). "Stochastic Shortest Paths Via Quasi-convex Maximization.". In Azar, Y. and Erlebach, T., editors, ESA, volume 4168 of Lecture Notes in Computer Science, pages 552-563. Springer. (Pubitemid 44699679)
11. Orda, A. (1999). "Routing with end-to-end QoS guarantees in broadband networks". IEEE/ACM Trans. Netw., 7(3), pp. 365-374.
12. Raghavan, P. and Tompson, C. D. (1987). "Randomized rounding: a technique for provably good algorithms and algorithmic proofs". Combinatorica, 7(4), pp. 365-374.
13. Sahni, S. (1977). "General Techniques for Combinatorial Approximation". Operations Research, 26(5).
14. Smith, N. A. and Eisner, J. (2005). "Contrastive estimation: training log-linear models on unlabeled data". In ACL '05: Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics, pages 354-362, Morristown, NJ, USA. Association for Computational Linguistics.
15. Thollard, F.; de la Higuera, C; and Carrasco, R. C. (2005a). "Probabilistic Finite-State Machines-Part I". IEEE Trans. Pattern Anal. Mach. Intell., 27(7), pp. 1013-1025. Member-Enrique Vidal and Member-Francisco Casacuberta. (Pubitemid 41046898)
16. Thollard, F.; de la Higuera, C; and Carrasco, R. C. (2005b). "Probabilistic Finite-State Machines-Part II". IEEE Trans. Pattern Anal. Mach. Intell., 27(7), pp. 1026-1039. Member-Enrique Vidal and Member-Francisco Casacuberta. (Pubitemid 41046899)