A new approach for weighted constraint satisfaction: Theoretical and computational results

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1118, Issue , 1996, Pages 323-337

  Lau, Hoong Chuin ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957880618     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61551-2_84     Document Type: Conference Paper

References (18)

1. F. Alizadeh. Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optimiz, 5(1):13-51, 1995.
2. Noga Alon and Joe Spencer. The Probabilistic Method. Wiley Interscience Ser. Disc. Math. and Optimiz., 1992.
3. Eugene C Freuder. Partial constraint satisfaction. In Proc. Int '1 Joint Conf. Artif. Intell. (IJCAI-89), pages 278-283, Detriot, MI, 1989.
4. Eugene C. Freuder and Richard J. Wallace. Partial Constraint Satisfaction. Artif. Intell., 58(1-3):21-70, 1992.
5. Katsuki Fujisawa and Masakazu Kojima. Sdpa (semidefinite programming algorithm) user's manual. Technical Report B-308, Dept. Information Science, Tokyo Inst. of Technology, 1995. Online implementation available at ftp.is. titech, ac.jp under directory/pub/OpsRes/software.
6. Michel X. Goemans and David P. Williamson. Approximation algorithms for MAX CUT and MAX 2SAT. In Proc. 26th ACM Symp. on Theory of Computing, pages 422-431, 1994. Full version to appear in J. ACM.
7. P. Lancaster and M Tismenetsky. The Theory of Matrices. Academic Press, Orlando, FL, 1985.
8. H. C. Lau. Approximation of constraint satisfaction via local search. In Proe. 4th Wrksp. on Algorithms and Data Structures (WADS), pages 461-472. Springer Verlag Lect. Notes Comp. Sci. (955), 1995.
9. H. C. Lau and O. Watanabe. Randomized approximation of the constraint satisfaction problem. In Proc. Fifth Scandinavian Wrksp. on Algorithm Theory (SWAT). Springer Verlag Lect. Notes Comp. Sci., 1996. To appear.
10. S. Mahajan and H. Ramesh. Derandomizing semidefinite programming based approximation algorithms. In Proc. 36th IEEE Symp. on Found. of Comp. Sci., pages 162-168, 1995.
11. P. Raghavan and C. D. Thompson. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica, 7(4):365-374, 1987.
12. Edward Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.
13. Peter van Beek. On-line C-programs available at ftp.cs.ualberta.ca under directory/pub/ai/csp.
14. Chris Voudouris and Edward Tsang. Parital constraint satisfaction problems and guided local search. Technical Report No. CSM-250, Dept. Computer Science, University of Essex, 1995.
15. Richard J. Wallace, 1995. Personal communication.
16. Richard J. Wallace. Directed arc consistency preprocessing as a strategy for maximal constraint satisfaction. In M. Meyer, editor, Constraint Processing, pages 121-138. Springer Verlag Lect. Notes Comp. Sci. (923), 1995.
17. Richard J. Wallace and Eugene C. Freuder. Conjuctive width heuristics for maximal constraint satisfaction. In Proc. Nat'l Conf. on Artif. Intell. (AAAI-93), pages 762-768, 1993.
18. Richard J. Wallace and Eugene C. Freuder. Heuristic methods for over-constrained constraint satisfaction problems. In CP95 Wrksp. on Over-constrained Systems, 1995.