Marius Zimand  Home/Search
Context Related
| 168.18.216.164/~zimand/pape...approx.ps peachnet.edu/~zimand/papers...approx.ps 136.160.177.125/pub/approx.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: peachnet.edu/~mz...onlinepapers (more) From: peachnet.edu/~zi...onlinepapers (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Extending a well-known property of NP optimization problems in which the value of the optimum is guaranteed to be polynomially bounded in the length of the input, it is observed that, by attaching weights to tuples over the domain of the input, all NP optimization problems admit a logical characterization. It is shown that any NP optimization problem can be stated as a problem in which the constraint conditions can be expressed by a \Pi 2 first-order formula. The paper analyzes the weighted... (Update)
Context of citations to this paper: More
...that can be substituted for the free variables x and showed that the approximation properties are provided. In a recent paper Zimand [13] analyzed the weighted variants of all syntactically defined classes that are known to have good approximation properties. To extend this...
...technique can be used to approximate both the problems in Max NP and those in the weighted version of this class. More recently, Zimand [31] studied the approximability properties of logically defined weighted problems, allowing negative weights (but nonnegative objective...
Cited by: More
Query-Preserving Watermarking of Relational Databases and XML.. - Gross-Amblard (2003) (Correct)
Integer Programming as a Framework for Optimization and.. - Barland, Kolaitis (1996) (Correct)
On Weighted vs Unweighted Versions of Combinatorial.. - Crescenzi.. (2001) (Correct)
Similar documents (at the sentence level):
54.2%: Weighted NP Optimization Problems: Logical Definability and.. - Zimand (1995) (Correct)
Active bibliography (related documents): More All
0.3: Log-Approximable Minimization Problems on - Random Inputs Anders (Correct)
0.3: Martin-Löf Tests Can Help Too - Zimand (1994) (Correct)
0.2: Optimization Problems: Expressibility, Approximation.. - Behrendt, Compton.. (1993) (Correct)
Similar documents based on text: More All
0.1: The Character of the Infinite Wedge Representation - Bloch, Okounkov (Correct)
0.1: Invariant Definability (Extended Abstract) - Makowsky (1997) (Correct)
0.1: A High-Low Kolmogorov Complexity Law Equivalent To The 0-1 Law - Zimand (Correct)
Related documents from co-citation: More All
5: On Syntactic versus Computational Views of Approximability - Khanna, Motwani et al. - 1994
4: and Complexity Classes (context) - Papadimitriou, Yannakakis et al. - 1991
3: the hardness of approximating Max k-Cut and its dual - Kann, Khanna et al. - 1996
BibTeX entry: (Update)
M. Zimand. Weighted NP optimization problems: logical definability and approximation properties. In Proceedings of the 10th IEEE Conference on Structure in Complexity Theory, pages 12--28, 1995. http://citeseer.ist.psu.edu/zimand95weighted.html More
@techreport{ zimand95weighted,
author = "Marius Zimand",
title = "Weighted {NP} Optimization Problems: Logical Definability and Approximation Properties",
number = "TR516",
year = "1995",
url = "citeseer.ist.psu.edu/zimand95weighted.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
300 the hardness of approximating minimization problems (context) - Lund, Yannakakis - 1993
242 Non-deterministic exponential time has two-prover interactiv.. - Babai, Fortnow et al. - 1991
210 Generalized first-order spectra and polynomial-time recogniz.. (context) - Fagin - 1974
203 Approximating clique is almost NP complete (context) - Feige, Goldwasser et al. - 1991
173 Proof verification and intractability of approximation probl.. (context) - Arora, Lund et al. - 1992
144 The NP-completeness column: An ongoing guide (context) - Johnson - 1992
126 Efficient probabilistically checkable proofs and application.. - Bellare, Goldwasser et al. - 1993
108 Improved non-approximability results - Bellare, Sudan - 1994
104 approximation and complexity classes (context) - Papadimitriou, Yannakakis - 1991
93 the power of multi-prover interactive protocols - Fortnow, Rompel et al. - 1988
83 On syntactic versus computational views of approximability - Khanna, Motwani et al. - 1994
75 Approximation algorithms for the set covering and vertex cov.. (context) - Hochbaum - 1982
61 Descriptive and computational complexity - Immerman - 1989
50 Nearly-linear size holographic proofs (context) - Polishchuk, Spielman - 1994
45 Two prover protocols - low error at affordable rates (context) - Feige, Kilian - 1994
41 Approximation properties of NP minimization classes (context) - Kolaitis, Thakur - 1995
40 The approximation of maximum subgraph problems (context) - Lund, Yannakakis - 1993
32 Logical definability of NP optimization problems - Kolaitis, Thakur - 1994
31 laws in logic and combinatorics (context) - Compton - 1988
30 A linear time approximation algorithm for the weighted verte.. (context) - Bar-Yehuda, Even - 1981
25 NP-complete problems have a version that's hard to approxima.. (context) - Zuckerman - 1993
24 and nonapproximability -towards tight results (context) - Bellare, Goldreich et al. - 1995
20 Complexity classes and theories of finite models (context) - Lynch - 1982
14 Theoretical Computer Science (context) - Panconesi, Ranjan et al. - 1993
12 The complexity of the max word problem and the power of onew.. (context) - Condon - 1991
10 The spectra of first-order sentences and computational compl.. (context) - Grandjean - 1984
6 Two-prover one round systems: Their power and their problems (context) - Feige, Lov'asz - 1992
6 Wiley and Sons (context) - Gondran, Minoux et al. - 1984
5 Logical definability of NP optimization problems with monadi.. (context) - Lautemann - 1992
4 approximation properties and expected asymptotic growth of o.. (context) - Behrendt, Compton et al. - 1992
3 Approximable minimization problems and optimal solutions on .. - Gradel, Malmstrom - 1993
2 A greeedy heuristics for the set covering problem (context) - Chv'atal - 1979
2 Technical Report IBM RC (context) - Bellare, approximation - 1992
2 The complexity of the optimal spanning hypertree problem - Zimand - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://facweb.gsw.peachnet.edu/~mzimand/on-line-papers.html): More
Worlds To Die For - Hemaspaandra, Ramachandran, Zimand (1995) (Correct)
Power Balance and Apportionment Algorithms for the .. - Hemaspaandra.. (1998) (Correct)
Sampling Under Adverse Conditions With Applications to.. - Zimand (1999) (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