Weixiong Zhang  Home/Search
Context Related
| wustl.edu/~zhang/publicatio...cp2001.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wustl.edu/~zhang/publicat...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Many real-world problems involve constraints that cannot be all satisfied. Solving an overconstrained problem then means to find solutions minimizing the number of constraints violated, which is an optimization problem. In this research, we study the behavior of the phase transitions and backbones of constraint optimization problems. We rst investigate the relationship between the phase transitions of Boolean satisfiability, or precisely 3-SAT (a well-studied NP-complete decision problem), and... (Update)
Similar documents based on text: More All
2.1: Phase Transitions and Backbones of Constraint Minimization Problems - Zhang (2001) (Correct)
0.5: Approximation algorithms for MAX 4-SAT and rounding.. - Halperin, Zwick (1999) (Correct)
0.5: Worst-case time bounds for MAX-k-SAT w.r.t. the number of.. - Hirsch (2000) (Correct)
Related documents from co-citation: More All
2: Partial Constraint Satisfaction - Freuder, Wallace - 1992
BibTeX entry: (Update)
W. Zhang. Phase transitions and backbones of 3-SAT and Maximum 3-SAT. In T. Walsh, editor, Proceedings of 7th International Conference on Principles and Practice of Constraint Programming (CP2001). Springer, 2001. 280 http://citeseer.ist.psu.edu/zhang01phase.html More
@inproceedings{ zhang01phase,
author = "Weixiong Zhang",
title = "Phase Transitions and Backbones of 3-{SAT} and Maximum 3-{SAT}",
booktitle = "Principles and Practice of Constraint Programming",
pages = "153-167",
year = "2001",
url = "citeseer.ist.psu.edu/zhang01phase.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
473 Foundations of Constraint Satisfaction (context) - Tsang - 1993
390 A machine program for theorem proving (context) - Davis, Logemann et al. - 1962
329 Where the really hard problems are - Cheeseman, Kanefsky et al. - 1991
320 Hard and easy distributions of SAT problems - Mitchell, Selman et al. - 1992
311 Partial constraint satisfaction - Freuder, Wallace - 1992
33 Determining computational complexity from characteristic 'ph.. (context) - Monasson, Zecchina et al. - 1999
31 Phase transitions and the search problem (context) - Hogg, Huberman et al. - 1996
30 Clustering at the phase transition - Parkes - 1997
20 Backbone fragility and the local search cost peak - Singer, Gent et al. - 2000
18 Performance of linear-space search algorithms (context) - Zhang, Korf - 1995
17 The TSP phase transition - Gent, Walsh - 1996
16 Searching for an optimal path in a tree with random costs (context) - Karp, Pearl - 1983
13 Backbones in optimization and approximation - Slaney, Walsh - 2001
13 A generic framework for constraint-directed search and sched.. (context) - Beck, Fox - 1998
13 A study of complexity transitions on the asymmetric Travelin.. (context) - Zhang, Korf - 1996
12 Frozen development in graph coloring - Culberson, Gent - 2001
9 Phase transitions and annealed theories: Number partitioning.. - Gent, Walsh - 1996
7 the hardness of decision and optimisation problems - Slaney, Thiebaux - 1998
6 State-Space Search: Algorithms (context) - Zhang - 1999
4 Probabilistic analysis of tree search - McDiarmid - 1990
3 Phase transitions in articial intelligence systems (context) - Huberman, Hogg - 1987
3 tutorial on Solving and Programming with Soft Constraints: T.. (context) - Codognet, Rossi et al.
3 Generating satisable problem instances (context) - Achlioptas, Gomes et al. - 2000
3 Conguration space analysis of traveling salesman problems (context) - Kirkpatrick, Toulouse - 1985
Documents on the same site (http://siesta.wustl.edu/~zhang/publications/index.html): More
A Template-Based and Pattern-Driven Approach to Situation.. - Zhang, al. (2000) (Correct)
Truncated Branch-and-Bound: A Case Study on the Asymmetric TSP - Zhang (1993) (Correct)
Depth-First Branch-and-Bound versus Local Search: A Case Study - Zhang (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC