A Linear-Time Approximation Algorithm for Weighted Matchings in Graphs

ACM Transactions on Algorithms

Volumn 1, Issue 1, 2005, Pages 107-122

  Drake Vinkemeier, Doratha E ^a   Hougardy, Stefan ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Algorithms; Approximation algorithm; Maximum weight matching; Theory

Indexed keywords

EID: 84995706345     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1077464.1077472     Document Type: Article

References (49)

1. Abadi, M. and Manna, Z. 1985. Nonclausal Temporal Deduction. Lecture Notes in Computer Science 193, 1-15.
2. Abadi, M. and Manna, Z. 1990. Nonclausal Deduction in First-Order Temporal Logic. ACM Journal 37, 2 (Apr.), 279-317.
3. Artale, A. and Franconi, E. 1999. Introducing Temporal Description Logics. In Proceedings of the Sixth International Workshop on Temporal Representation and Reasoning (TIME-99), C. Dixon and M. Fisher, Eds. IEEE Computer Society Press, Orlando, Florida. ISBN 0-7695-0173-7.
4. Barringer, H., Fisher, M., Gabbay, D., Owens, R., and Reynolds, M., Eds. 1996. The Imperative Future: Principles of Executable Temporal Logic. Research Studies Press.
5. Bjorner, N., Browne, A., Chang, E., Cólon, M., Kapur, A., Manna, Z., Sipma, H. B., and Uribe, T. E. 1995. STeP the Stanford Temporal Prover Educational Release Version 1. 0 User's Manual. Computer Science Department, Stanford University, California 94305.
6. Bolotov, A. and Fisher, M. 1997. A Resolution Method for CTL Branching-Time Temporal Logic. In Proceedings of TIME-97 the Fourth International Workshop on Temporal Representation and Reasoning. IEEE Computer Society Press, Daytona Beach, Florida, 20-27.
7. Burgess, J. P. and Gurevich, Y. 1985. The Decision Problem for Linear Temporal Logics. Notre Dame Journal of Formal Logic 26, 2 (Apr.), 115—128.
8. Cavalli, A. and Farinas del Cerro, L. 1984. A Decision Method for Linear Temporal Logic. In Proceedings of the 7th International Conference on Automated Deduction, R. E. Shostak, Ed. Lecture Notes in Computer Science, vol. 170. Springer-Verlag, 113-127.
9. Chang, C. L. and Lee, R. C. T. 1973. Symbolic Logic and Mechanical Theorem Proving. Academic Press.
10. Dixon, C. 1996. Search Strategies for Resolution in Temporal Logics. In Proceedings of the Thirteenth International Conference on Automated Deduction (CADE), M. A. McRobbie and J. K. Slaney, Eds. Lecture Notes in Artificial Intelligence, vol. 1104. Springer-Verlag, New Brunswick, New Jersey, 672-687.
11. Dixon, C. 1998. Temporal Resolution using a Breadth-First Search Algorithm. Annals of Mathematics and Artificial Intelligence 22, 87-115.
12. Dixon, C. 2000. Using Otter for Temporal Resolution. In Advances in Temporal Logic. Applied Logic Series, vol. 16. Kluwer, 149-166. Proceedings the Second International Conference on Temporal Logic (ICTL). ISBN 0-7923-6149-0.
13. Dixon, C. and Fisher, M. 1998. The Set of Support Strategy in Temporal Resolution. In Proceedings of TIME-98 the Fifth International Workshop on Temporal Representation and Reasoning. IEEE Computer Society Press, Sanibel Island, Florida.
14. Dixon, C., Fisher, M., and Johnson, R. 1995. Parallel Temporal Resolution. In Proceedings of TIME-95 the Second International Workshop on Temporal Representation and Reasoning. Melbourne Beach, Florida.
15. Dixon, C., Fisher, M., and Wooldridge, M. 1998. Resolution for Temporal Logics of Knowledge. Journal of Logic and Computation 8, 3, 345-372.
16. Emerson, E. A. 1990. Temporal and Modal Logic. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. Elsevier Science Publishers B. V.: Amsterdam, the Netherlands, 996-1072.
17. Emerson, E. A. and Srinivasan, J. 1988. Branching Time Temporal Logic. Lecture Notes in Computer Science 354, 123-172.
18. Fisher, M. 1991. A Resolution Method for Temporal Logic. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI). Morgan Kaufman, Sydney, Australia, 99-104.
19. Fisher, M. 1992. A Normal Form for First-Order Temporal Formulae. In Proceedings of Eleventh International Conference on Automated Deduction (CADE). Lecture Notes in Computer Science, vol. 607. Springer-verlag, Saratoga Springs, New York, 370-384.
20. Fisher, M. 1997. A Normal Form for Temporal Logic and its Application in Theorem-Proving and Execution. Journal of Logic and Computation 7, 4 (Aug.), 429-456.
21. Fisher, M. and Dixon, C. 2000. Guiding Clausal Temporal Resolution. In Advances in Temporal Logic. Applied Logic Series, vol. 16. Kluwer, 167-184. Proceedings the Second International Conference on Temporal Logic (ICTL). ISBN 0-7923-6149-0.
22. Fisher, M. and Noël, P. 1992. Transformation and Synthesis in MetateM—Part I: Prepositional MetateM. Technical Report UMCS-92-2-1, Department of Computer Science, University of Manchester, Oxford Road, Manchester M13 9PL, U. K. Feb.
23. Gabbay, D., Pnueli, A., Shelah, S., and Stavi, J. 1980. The Temporal Analysis of Fairness. In Proceedings of the Seventh ACM Symposium on the Principles of Programming Languages. Las Vegas, Nevada, 163-173.
24. Gabbay, D. M. 1987. Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems. In Proceedings of Colloquium on Temporal Logic in Specification, B. Banieqbal, H. Barringer, and A. Pnueli, Eds. Lecture Notes in Computer Science, vol. 398. Springer-Verlag, Altrincham, U.K., 402-450.
25. Gough, G. D. 1984. Decision Procedures for Temporal Logic. M.S. thesis, Department of Computer Science, University of Manchester. Also University of Manchester, Department of Computer Science, Technical Report UMCS-89-10-1.
26. Harel, D. and Pnueli, A. 1985. On the Development of Reactive Systems. Tech. Rep. CS85-02, Department of Applied Mathematics, the Weizmann Institute of Science, Rehovot, Israel. Jan.
27. Holzmann, G. J. 1997. The Model Checker Spin. IEEE Trans. On Software Engineering 23, 5 (May), 279-295. Special Issue on Formal Methods in Software Practice.
28. Horrocks, I. 1998. The FaCT System. In Automated Reasoning with Analytic Tableaux and Related Methods: International Conference (Tableaux'98). LNCS, vol. 1397. Springer-Verlag, 307-312.
29. Hustadt, U. and Schmidt, R. 1999. An Empirical Analysis of Modal Theorem Provers. Journal of Applied Non-Classical Logics 9, 4, 479-522.
30. Jaeger, G., Balsiger, P., Heuerding, A., Schwendimann, S., Bianchi, M., Guggisberg, K., Janssen, G., Heinle, W., Achermann, F., Boroumand, A. D., Brambilla, P., Bucher, I., and Zimmermann, H. 2000. LWB-The Logics Workbench 1.1. http://www.lwb.unibe.ch/. University of Berne, Switzerland.
31. Lamport, L. 1983. Specifying Concurrent Program Modules. ACM Transactions on Programming Languages and Systems 5, 2 (Apr.), 190-222.
32. Lichtenstein, O., Pnueli, A., and Zuck, L. 1985. The Glory of the Past. In Logics of Programs (Proc. Conf. Brooklyn USA 1985), R. Parikh, Ed. Lecture Notes in Computer Science, vol. 193. Springer-Verlag, Berlin, 196-218.
33. Manna, Z. and Pnueli, A. 1992. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, New York.
34. Manna, Z. and Pnueli, A. 1995. Temporal Verification of Reactive Systems: Safety. SpringerVerlag, New York.
35. McCune, W. 1994. Otter 3.0 Reference Manual and Guide. Argonne National Laboratory, 9700 South Cass Avenue, Argonne, Illinois 60439-4801.
36. Plaisted, D. A. and Greenbaum, S. A. 1986. A Structure-Preserving Clause Form Translation. Journal of Symbolic Computation 2, 3 (Sept.), 293-304.
37. Pnueli, A. 1977. The Temporal Logic of Programs. In Proceedings of the Eighteenth Symposium on the Foundations of Computer Science. Providence.
38. Prior, A. 1967. Past, Present and Future. Oxford University Press.
39. Robinson, J. A. 1965. A Machine-Oriented Logic Based on the Resolution Principle. ACM Journal 12, 1 (Jan.), 23-41.
40. Schwendimann, S. 1998. A New One-Pass Tableau Calculus for PLTL. In Proceedings of Tableaux 98, H. de Swart, Ed. Lecture Notes in Artificial Intelligence, vol. 1397. Springer-Verlag, 277-291.
41. Sistla, A. P. and Clarke, E. M. 1985. Complexity of Propositional Linear Temporal Logics. ACM Journal 32, 3 (July), 733-749.
42. Sistla, A. P., Vardi, M., and Wolper, P. 1987. The Complementation Problem for Buchi Automata with Applications to Temporal Logic. Theoretical Computer Science 49, 217-237.
43. Steedman, M. 1997. Temporality. In Handbook of Logic and Language. Elsevier North Holland, 895-935.
44. Stirling, C. 1992. Modal and Temporal Logics. In Handbook of Logic in Computer Science. Oxford university Press.
45. Tansel, A., Ed. 1993. Temporal Databases: theory, design, and implementation. Benjamin/Cummings.
46. Venkatesh, G. 1986. A Decision Method for Temporal Logic Based on Resolution. Lecture Notes in Computer Science 206, 272-289.
47. Weidenbach, C. 1997. Spass: Version 0.49. Journal of Automated Reasoning 18, 247-252.
48. Wolper, P. 1983. Temporal Logic Can Be More Expressive. Information and Control 56, 72-99.
49. Wos, L., Overbeek, R., Lusk, E., and Boyle, J. 1984. Automated Reasoning—Introduction and Applications. Prentice-Hall, Englewood Cliffs, New Jersey.