E. Amaldi, Viggo Kann  Home/Search
Context
Related
| informatik.unitrier.de/pub/...Paper.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: fermivista.math...ik.unitrier.de (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We investigate the computational complexity of two classes of combinatorial optimization problems related to linear systems and study the relationship between their approximability properties. In the first class (Min ULR) one wishes, given a possibly infeasible system of linear relations, to find a solution that violates as few relations as possible while satisfying all the others. In the second class (Min RVLS) the linear system is supposed to be feasible and one looks for a solution with as... (Update)
Similar documents (at the sentence level):
76.9%: On the Approximability of Some NP-hard Minimization Problems.. - Amaldi, Kann (1996) (Correct)
55.4%: On the Approximability of Minimizing Nonzero Variables Or.. - Amaldi, Kann (1997) (Correct)
32.2%: On the Approximability of Removing the Smallest Number of.. - Amaldi, Kann (1995) (Correct)
Active bibliography (related documents): More All
1.5: On the Maximum Feasible Subsystem Problem, IISs and.. - Amaldi, Pfetsch.. (2002) (Correct)
1.0: The Complexity and Approximability of Finding Maximum Feasible .. - Amaldi, Kann (1993) (Correct)
0.8: On the Complexity of Designing Compact Perceptrons and Some.. - Edoardo Amaldi (Correct)
Similar documents based on text: More All
0.6: On Syntactic versus Computational Views of Approximability - Khanna, Motwani, Sudan.. (1994) (Correct)
0.5: Clique is Hard to Approximate within ... - Håstad (1997) (Correct)
0.5: On-Orbit Estimates of Telescope Misalignment and Quaternion-Based.. - Team (1997) (Correct)
BibTeX entry: (Update)
@article{ amaldi96approximability,
author = "Edoardo Amaldi and Viggo Kann",
title = "On the approximability of some {NP}-hard minimization problems for linear systems",
journal = "Electronic Colloquium on Computational Complexity (ECCC)",
volume = "3",
number = "015",
year = "1996",
url = "citeseer.ist.psu.edu/amaldi96approximability.html" }
Citations (may not include all citations):4212 Computers and Intractability: a guide to the theory of NP-co.. (context) - Garey, Johnson - 1979
2133 Pattern classification and scene analysis (context) - Duda, Hart - 1973
493 Communications of ACM (context) - Valiant, of et al. - 1984
448 A new polynomial time algorithm for linear programming (context) - Karmarkar - 1984
403 Proof verification and hardness of approximation problems - Arora, Lund et al. - 1992
300 the hardness of approximating minimization problems (context) - Lund, Yannakakis - 1994
248 An introduction to Computational Learning Theory (context) - Kearns, Vazirani - 1994
226 for approximating set cover (context) - Feige, of - 1995
221 Perceptrons: An introduction to computational Geometry (context) - Minsky, Papert - 1988
190 Inductive inference: theory and methods (context) - Angluin, Smith - 1983
184 Cryptographic limitations on learning boolean formulae and f.. - Kearns, Valiant - 1994
126 Efficient probabilistically checkable proofs and application.. - Bellare, Goldwasser et al. - 1993
124 Robust linear programming discrimination of two linearly ins.. - Bennett, Mangasarian - 1992
120 The hardness of approximate optima in lattices (context) - Arora, Babai et al. - 1993
120 The hardness of approximate optima in lattices (context) - Arora, Babai et al. - 1994
115 PCPs and non-approximability -- towards tight results (context) - Bellare, Goldreich et al. - 1995
106 Discriminant analysis and statistical pattern recognition (context) - McLachlan - 1992
95 Fundamentals of artificial neural networks (context) - Hassoun - 1995
77 Perceptron-based learning algorithms (context) - Gallant - 1990
51 the Approximability of NP-complete Optimization Problems (context) - Kann - 1992
48 The complexity and approximability of finding maximum feasib.. - Amaldi, Kann - 1995
45 Approximating minimum feedback sets and multi-cuts in direct.. - Even, Naor et al. - 1995
42 Algorithms and Complexity (context) - Papadimitriou, Steiglitz - 1982
42 Packing directed circuits fractionally (context) - Seymour - 1995
41 Completeness in approximation classes (context) - Crescenzi, Panconesi - 1991
37 To weight or not to weight: Where is the question - Crescenzi, Silvestri et al. - 1995
37 Structure in approximation classes - Crescenzi, Kann et al. - 1995
36 La Sapienza (context) - Crescenzi, Kann et al. - 1995
30 Robust trainability of single neurons - Hoffgen, Simon et al. - 1995
29 Complexity results on learning by neural nets - Lin, Vitter - 1991
24 Freeman and Co (context) - Chvatal - 1983
20 Polynomially bounded minimization problems that are hard to .. - Kann - 1994
19 A thermal perceptron learning rule (context) - Frean - 1992
18 On learning simple neural concepts: from halfspace intersect.. - Marchand, Golea - 1993
18 the complexity of training perceptrons (context) - Amaldi - 1991
15 Theoretical Computer Science (context) - Johnson, Preparata et al. - 1978
14 From finding maximum feasible subsystems of linear systems t.. (context) - Amaldi - 1994
14 Locating minimal infeasible constraint sets in linear progra.. (context) - Chinneck, Dravnieks - 1991
12 Approximating the minimum maximal independence number (context) - Halld'orsson - 1993
11 The minimum feature set problem (context) - van Horn, Martinez - 1994
11 The minimum feature set problem (context) - van Horn, Martinez - 1992
10 Interscience series in discrete mathematics and optimization (context) - Schrijver, linear et al. - 1986
10 Identifying minimally infeasible subsystems of inequalities (context) - Gleeson, Ryan - 1990
8 Linear discriminant functions determined by genetic search (context) - Koehler - 1991
7 Trees and Hills: Methodology for Maximizing Functions of Sys.. (context) - Greer - 1984
7 Minimizing misclassifications in linear discriminant analysi.. (context) - Koehler, Erenguc - 1990
7 Strong lower bounds on the approximability of some NPO PB-co.. - Kann - 1995
7 the probabilistic and thermal perceptron training algorithms (context) - Amaldi, Diderich - 1994
7 Approaches to diagnosing infeasible linear programs (context) - Greenberg, Murphy - 1991
7 the approximability of removing the smallest number of relat.. - Amaldi, Kann - 1994
6 An effective polynomial-time heuristic for the minimum-cardi.. (context) - Chinneck - 1995
6 Finding the minimum weight IIS cover of an infeasible system.. (context) - Parker, Ryan - 1995
6 An algorithm for optimal solution of linear inequalities and.. (context) - Warmack, Gonzalez - 1973
5 A note on resolving infeasibility in linear programs by cons.. (context) - Sankaran - 1993
5 A set covering approach to infeasibility analysis of linear .. - Parker - 1995
4 and implied equalities in linear systems (context) - Greenberg, redundancy - 1993
3 Complexity of problems related to training perceptrons (context) - Amaldi - 1992
3 Redundency and Helly for linear programming (context) - Edmonds - 1994
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.informatik.uni-trier.de.html): More
Symmetric Logspace is Closed Under Complement - Nisan, Ta-Shma (1994) (Correct)
Pattern-Matching for Strings with Short Descriptions - Karpinski, al. (1995) (Correct)
Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem - Goldreich, al. (1997) (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