Ian Barland, Phokion G. Kolaitis  Home/Search
Context Related
| ucsc.edu/~kolaitis/papers/jcss98.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: ucsc.edu/~kolaitis/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Structural approximation theory seeks to provide a framework for expressing optimization problems, and isolating structural or syntactic conditions that explain the apparent difference in the approximation properties of different NP-optimization problems. In this paper, we initiate a study of structural approximation using integer programming (an optimization problem in its own right) as a general framework for expressing optimization problems. We isolate three classes of... (Update)
Context of citations to this paper: More
.... well established connection between the syntactic description and the approximation behaviour of NPO problems ( 15] 17] 13] 12] 5] [4], 10] 11] Our work builds on the impressive collection of non approximability results derived over the last five years, initiated by...
...of the value of x k and when f i = 0 then this forces x k = 0. Recall that the linear integer programs introduced by Barland et al. BKT96] have all their restrictions that are dominating ones. In this sense, an instance of linear programming containing triplets can be seen...
Cited by: More
The (Parallel) Approximability of Non-Boolean.. - Serna, Trevisan, Xhafa (Correct)
A Structural View Of Approximation - Khanna (1996) (Correct)
The Parallel Approximability of the Fals True Gates Problems.. - Serna, Xhafa (1998) (Correct)
Active bibliography (related documents): More All
0.5: Lower Bounds for non-Boolean Constraint Satisfaction Programs - Engebretsen (2000) (Correct)
0.3: Weighted NP Optimization Problems: Logical Definability and.. - Zimand (1995) (Correct)
0.2: Computational Experience with Approximation Algorithms for.. - Grossman, Wool (1994) (Correct)
Similar documents based on text: More All
0.3: On the Expressive Power of Logics on Finite Models - Kolaitis (2003) (Correct)
0.3: Constraint Satisfaction - Complexity And Logic (Correct)
0.3: Infinitary Logics and 0-1 Laws - Kolaitis, Vardi (1992) (Correct)
Related documents from co-citation: More All
5: A dichotomy theorem for maximum generalized satisfiability problems (context) - Creignou - 1995
5: Towards a syntactic characterization of PTAS - Khanna, Motwani - 1996
5: Approximation properties of NP minimization classes (context) - Kolaitis, Thakur - 1995
BibTeX entry: (Update)
I. Barland, P.G. Kolaitis, and M.N. Thakur. Integer programming as a framework for optimization and approximability. In Proceedings of the 11th IEEE Conference on Computational Complexity, pages 249--259, 1996. http://citeseer.ist.psu.edu/barland96integer.html More
@inproceedings{ barland96integer,
author = "Ian Barland and Phokion G. Kolaitis and Madhukar N. Thakur",
title = "Integer Programming as a Framework for Optimization and Approximability",
booktitle = "{IEEE} Conference on Computational Complexity",
pages = "249-259",
year = "1996",
url = "citeseer.ist.psu.edu/barland96integer.html" }
Citations (may not include all citations):293 Approximation algorithms for combinatorial problems (context) - Johnson - 1974
104 approximation and complexity classes (context) - Papadimitriou, Yannakakis - 1991
83 On syntactic versus computational views of approximability - Khanna, Motwani et al. - 1994
48 The complexity and approximability of finding maximum feasib.. - Amaldi, Kann - 1995
41 Approximation properties of NP minimization classes (context) - Kolaitis, Thakur - 1995
32 Logical definability of NP optimization problems - Kolaitis, Thakur - 1994
25 Quantifiers and approximation (context) - Panconesi, Ranjan - 1990
25 Tight bounds and 2-approximation algorithms for integer prog.. - Hochbaum, Megiddo et al. - 1993
25 Expressing combinatorial optimization problems by integer pr.. (context) - Yannakakis - 1991
23 Approximating clique is NP-complete (context) - Arora, Safra - 1992
15 Interactive proofs and approximation: Reductions from two pr.. - Bellare - 1993
6 Weighted np optimization problems: Logical definability and .. - Zimand - 1995
4 Approximating bounded 0-1 integer linear programs (context) - Peleg, Schechtman et al. - 1993
4 approximation properties and expected asymptotic growth of o.. (context) - Behrendt, Compton et al. - 1992
2 approximability of non-boolean satisfiability problems and r.. (context) - Serna, Trevisan et al. - 1998
1 Integer programming formulation of combinatorial optimizatio.. (context) - Ibaraki - 1976
1 Proof verification and hardness of aproximation problems (context) - Arora, Lund et al. - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cse.ucsc.edu/~kolaitis/): More
A Game-Theoretic Approach to Constraint Satisfaction - Kolaitis, Vardi (Correct)
Existential Second-Order Logic over Graphs: Charting.. - Gottlob, Kolaitis.. (2000) (Correct)
First-Order Logic vs. Fixed-Point Logic in Finite Set Theory - Atserias, Kolaitis (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