David S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9(3):256--278, 1974. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Geometric and Dynamic Sensing: Observation of Pose and Motion.. - Jia (1997) (Correct)
No context found.
David S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9(3):256--278, 1974.
Greedy Algorithms for on-Line Set-Covering and Related.. - Ausiello, Giannakos.. (2006) (Correct)
No context found.
Johnson, D. S. (1974), `Approximation algorithms for combinatorial problems', J. Comput. System Sci. 9, 256--278.
Adaptive Statistical Optimization Techniques for - Firewall Packet Filtering (Correct)
No context found.
D. S. Johnson. Approximation algorithms for combinatorial problems. In STOC '73: Proceedings of the fifth annual ACM symposium on Theory of computing, pages 38--49, 1973.
Adaptive Statistical Optimization Techniques for.. - Hamed, El-Atawy.. (2006) (Correct)
No context found.
D. S. Johnson. Approximation algorithms for combinatorial problems. In STOC '73: Proceedings of the fifth annual ACM symposium on Theory of computing, pages 38--49, 1973.
Key Management for Restricted Multicast Using Broadcast.. - Abdalla, Shavitt, Wool (2000) (7 citations) (Correct)
No context found.
D. S. Johnson, "Approximation algorithms for combinatorial problems," J. Comput. Syst. Sci., vol. 9, pp. 256--278, 1974.
Design and Analysis of Secure Encryption Schemes - Abdalla (2001) (Correct)
No context found.
D. S. Johnson. Approximation algorithms for combinatorial problems. J. Computer System Sci., 9:256--278, 1974.
Composition of modules' stock using Simulated Annealing - Catherine Da Cunha (2005) (Correct)
No context found.
David Johnson, "Approximation algorithms for combinatorial problems," Journal of Computer and System Sciences, vol. 9, pp. 256--278, 1974.
The Specification of Agent Behavior by Ordinary People: A .. - McDowell, Etzioni, Halevy (2004) (Correct)
No context found.
D. S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9:256--278, 1974.
The Electronic Primaries - Predicting the U.S. Presidency.. - Berretta, al. (2005) (Correct)
No context found.
D. Johnson, Approximation algorithms for combinatorial problems, J. Comput. System Sci. 9, (1974), pages 256-278
Semantic Email: Theory and Applications - McDowell, Etzioni, Halevy (2004) (Correct)
No context found.
D. S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9:256--278, 1974.
Predicting Protein-Protein Interactions from.. - Huang, Kanaan.. (2004) (Correct)
No context found.
Johnson, D. S. (1974) Approximation algorithms for combinatorial problems. J. Comput. System Sci., 9, 256--278.
Hierarchical Decompositions for Visualizing Large Graphs - Finocchi (2002) (Correct)
No context found.
Johnson, D. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences 9 (1974), 256--278.
Constant-Time Distributed Dominating Set Approximation - Kuhn, Wattenhofer (2003) (7 citations) (Correct)
No context found.
D. S. Johnson. Approximation Algorithms for Combinatorial Problems. Journal of Computer and System Sciences, 9:256--278, 1974.
Probabilistically Checkable Debate Systems and - Approximation Algorithms For (1993) (Correct)
No context found.
D. S. Johnson, Approximation algorithms for combinatorial problems, J. Comput. System Sci., 9 (1974), pp. 256-278. --30--
Randomized Approximation Algorithms for Set Multicover.. - Berman, DasGupta, Sontag (2004) (Correct)
No context found.
D. S. Johnson. Approximation Algorithms for Combinatorial Problems, Journal of Computer and Systems Sciences, Vol. 9, 1974, pp. 256-278.
Priority Algorithms for Graph Optimization Problems - Borodin, Boyar, Larsen (Correct)
No context found.
David S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9(3):256--278, 1974.
Designing Overlay Multicast Networks for Streaming - Andreev, Maggs, Meyerson.. (2003) (Correct)
No context found.
D. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 1974.
On Network Design Problems: Fixed Cost Flows and the.. - Even, Kortsarz, Slany (2001) (Correct)
No context found.
Johnson, D. S. \Approximation algorithms for combinatorial problems", J. Comput. System Sci. 9, 256-278, 1974.
The Primal-Dual Method for Approximation Algorithms - Williamson (4 citations) (Correct)
No context found.
D. S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9:256--278, 1974.
Floorplanning Optimization with Trajectory.. - Long, Simonson, Liao, He (2004) (2 citations) (Correct)
No context found.
D. S. Johnson, "Approximation algorithms for combinatorial problems," J. Comput. Sys. Sci., vol. 9, pp. 256--278.
Learning in the Presence of Malicious Errors - Michael Kearns Att (1993) (81 citations) (Correct)
No context found.
D. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and Systems Sciences, 9, 1974, pp. 256-276.
A New 3/4-Approximation Algorithm for MAX SAT - Goemans, Williamson (1994) (13 citations) (Correct)
No context found.
D. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9:256--278, 1974.
Polynomial-Time Data Reduction for DOMINATING SET - Alber, Fellows, Niedermeier (2004) (Correct)
No context found.
D. S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences , 9: 256--278, 1974.
Approximation Algorithms for MaxSAT - Morales-Luna, Luna (1995) (Correct)
No context found.
Johnson D.: \Approximation algorithms for combinatorial problems", Jour. of computer and syst. sci. vol. 9, pp. 256-278, 1974.
Vertex Cover on 4-regular Hyper-graphs is Hard to Approximate.. - Holmerin (2001) (5 citations) (Correct)
No context found.
David S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9:256-278, December 1974.
A General Approximation Technique For Constrained Forest.. - Goemans, Williamson (1995) (139 citations) (Correct)
No context found.
D. S. Johnson, Approximation algorithms for combinatorial problems, Journal of Computer and System Sciences, 9 (1974), pp. 256--278.
Hierarchical Decompositions for Visualizing Large Graphs - Finocchi (2002) (Correct)
No context found.
Johnson, D. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences 9 (1974), 256--278.
A Combinatorial Approximation Algorithm for the Group.. - Chekuri, Even, Kortsarz (2002) (1 citation) (Correct)
No context found.
Johnson, D. S. Approximation algorithms for combinatorial problems, J. Comput. System Sci., 9, 256-278, 1974.
The PCP theorem and hardness of - Approximation Uriel Feige (Correct)
No context found.
D. Johnson. "Approximation algorithms for combinatorial problems." Journal of Computer and System Sciences, 9:256--278, 1974.
Improving Generation of Object-Oriented Test Suites by.. - Xie, Marinov, Notkin (2004) (Correct)
No context found.
D. S. Johnson. Approximation algorithms for combinatorial problems. J. Comput. System Sci., 9:256--278, 1974.
Approximating Covering Integer Programs with Multiplicity.. - Kolliopoulos (2000) (Correct)
No context found.
D. S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9:256-278, 1974.
Multi-Embedding and Path Approximation of Metric Spaces - Yair Bartal Manor (2003) (1 citation) (Correct)
No context found.
D.S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer ans System Science, 9:256-278, 1974.
Proxy Location problems and their generalizations - Choi, Shavitt (2003) (Correct)
No context found.
D. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9:256--278, 1974.
Approximation Algorithms for Disjoint Paths Problems - Kleinberg (1996) (62 citations) (Correct)
No context found.
D.S. Johnson, "Approximation algorithms for combinatorial problems," J. Computer and System Sci., 9(1974), pp. 256--278.
Approximation Algorithms for Finding Planar and Highly Connected .. - Fernandes (1997) (Correct)
No context found.
D. S. Johnson, "Approximation Algorithms for Combinatorial Problems," Journal of Computer and System Sciences, 9:256--278, 1974.
A Scalable Approach for Reliable Downstream Data.. - Park, Vedantham.. (2004) (1 citation) (Correct)
No context found.
JOHNSON, D. S. Approximation algorithms for combinatorial problems. In Journal of Computer and System Sciences 9 (1974), pp. 256--278.
Improved Approximation Algorithms for MAX SAT - Asano, Williamson (2000) (28 citations) (Correct)
No context found.
David S. Johnson, Approximation algorithms for combinatorial problems, Journal of Comput. and Sys. Sci. 9, pp. 256--278, 1974.
Placing Servers for Session-Oriented Services - Choi, Shavitt (2001) (1 citation) (Correct)
No context found.
D.S. Johnson, "Approximation algorithms for combinatorial problems," Journal of Computer and System Sciences, vol. 9, pp. 256--278, 1974.
Approximation Algorithms for Hitting Objects with Straight Lines - Hassin, Megiddo (1989) (2 citations) (Correct)
No context found.
D. S. Johnson, "Approximation algorithms for combinatorial problems", Journal of Computer and System Sciences 9 (1974) 256-278.
Poster: Sink-to-Sensors Reliability in Sensor Networks - Seung-Jong Park Raghupathy (2003) (Correct)
No context found.
David S. Johnson, "Approximation algorithms for combinatorial problems," in J. Computer and System Sciences 9, 1974, pp. 256--278.
Investigating ACO capabilities for solving the Maximum Clique.. - Solnon, Fenet (2004) (Correct)
No context found.
D.S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer Science, 9:256--278, 1974.
Selecting Complementary Pairs of Literals - Kaporis, Kirousis, Lalas (2003) (3 citations) (Correct)
No context found.
Johnson, D.S.: Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9 (1974) 256--278
A Multilevel Approach to the Graph Colouring Problem - Walshaw (2001) (Correct)
No context found.
D. S. Johnson. Approximation Algorithms for Combinatorial Problems. J. Comput. Syst. Sci., 9:256--278, 1974.
Language Models for Hierarchical Summarization - Lawrie (2003) (1 citation) (Correct)
No context found.
Johnson, D. S. Approximation algorithms for combinatorial problems. Journal of Computer System Science 9 (1974), 256--274.
On Probabilistic Proof Systems and Hardness of Approximation - Holmerin (2002) (Correct)
No context found.
David S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9:256278, December 1974.
A Bibliography for the Approximation Algorithms Minicourse - Williamson (1995) (Correct)
No context found.
D. S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9:256--278, 1974.
Covering Points with Lines - Langerman, Morin (Correct)
No context found.
D. S. Johnson. Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci., 9:256-278, 1974.
A New Approximation Algorithm for the Asymmetric TSP with.. - Bläser (2002) (Correct)
No context found.
D. S. Johnson. Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci, 9:256--278, 1974.
New 3/4-Approximation Algorithms for MAX SAT - Goemans, Williamson (1994) (13 citations) (Correct)
No context found.
D. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9:256--278, 1974. 4 -Approximation Algorithms for MAX SAT 12
A note on some variations of MaxSAT algorithms - Guillermo De Ita (Correct)
No context found.
D. Johnson, \Approximation algorithms for combinatorial problems", Journal of Computer and System Sciences 9, 256-278, 1974.
First 50 documents Next 50
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