CS Structure

About CS Structure | Search | Help  

 

  • neural network; genetic algorithm; finite element; mobile robot ( Subthemes )
  •          genetic local; delta-sigma adcs; memetic algorithm; traveling salesman ( Subthemes )
  •                  genetic local; delta-sigma adcs; memetic algorithm; traveling salesman ( Subthemes )
  •                          genetic local; delta-sigma adcs; memetic algorithm; traveling salesman ( Subthemes )
  • COMPUTERS AND INTRACTABILITY: A GUIDE TO THE THEORY OF NP-COMPLETENESS - GAREY, JOHNSON  
    By
    Date 
    Refs | Theme tree | Cited by 3328 This paper is cited in the following contexts

    Citation List: key=1000132
     

    Citation List:

    Citation Tree

    1) PROOF VERIFICATION AND THE HARDNESS OF APPROXIMATION PROBLEMS  
    By Carsten Lund    Mario Szegedy    Rajeev Motwani    Sanjeev Arora
    Date  August 2001
    Refs | Theme tree | Cited by 390 |  CiteSeer   (Hub and Authority Citation)

    2) WHERE THE REALLY HARD PROBLEMS ARE  
    By Bob Kanefsky    Peter Cheeseman    William M. Taylor
    Date  August 1995
    Refs | Theme tree | Cited by 275 |  CiteSeer   (Authority Citation)

    3) MANY BIRDS WITH ONE STONE: MULTI-OBJECTIVE APPROXIMATION ALGORITHMS  
    By D. J. Rosenkrantz    H. B. Hunt Iii    M. V. Marathe    R. Ravi    S. S. Ravi
    Date  February 1994
    Refs | Theme tree | Cited by 43 |  CiteSeer   (Authority Citation)

    4) TRAINING A 3-NODE NEURAL NETWORK IS NP-COMPLETE  
    By Avrim L. Blum    Ronald L. Rivest
    Date  January 1998
    Refs | Theme tree | Cited by 88 |  CiteSeer  

    5) ON THE COMPLEXITY OF PROPOSITIONAL KNOWLEDGE BASE REVISION, UPDATES, AND COUNTERFACTUALS  
    By And Counterfactuals    Georg Gottlob    Thomas Eiter
    Date  December 1995
    Refs | Theme tree | Cited by 82 |  CiteSeer  

    6) UPPER BOUNDS FOR VERTEX COVER FURTHER IMPROVED  
    By Computer Science    Peter Rossmanith    Prague Rolf Niedermeier    Rolf Niedermeier
    Date  December 1998
    Refs | Theme tree | Cited by 44 |  CiteSeer  

    7) QUALITY OF SERVICE ROUTING FOR SUPPORTING MULTIMEDIA APPLICATIONS  
    By Jon Crowcroft    Zheng Wang
    Date  April 1996
    Refs | Theme tree | Cited by 143 |  CiteSeer   (Authority Citation)

    8) ZERO KNOWLEDGE AND THE CHROMATIC NUMBER  
    By Joe Kilian    Uriel Feige
    Date  June 2000
    Refs | Theme tree | Cited by 79 |  CiteSeer  

    9) ON APPROXIMATING THE LONGEST PATH IN A GRAPH  
    By David Karger    G. D. S. Ramkumar    Rajeev Motwani
    Date  August 1995
    Refs | Theme tree | Cited by 29 |  CiteSeer   (Authority Citation)

    10) MULTICAST ROUTING FOR MULTIMEDIA COMMUNICATION  
    By George C. Polyzos    Joseph C. Pasquale    Vachaspathi P. Kompella
    Date  January 1994
    Refs | Theme tree | Cited by 109 |  CiteSeer  

    11) PARAMETERIZED COMPUTATIONAL FEASIBILITY  
    By Michael R. Fellows    Rodney G. Downey
    Date  June 1997
    Refs | Theme tree | Cited by 37 |  CiteSeer   (Authority Citation)

    12) A DISTRIBUTED ALGORITHM FOR DELAY-CONSTRAINED UNICAST ROUTING  
    By Douglas S. Reeves    Hussein F. Salama    Yannis Viniotis
    Date  September 1999
    Refs | Theme tree | Cited by 52 |  CiteSeer  

    13) STRUCTURE IN APPROXIMATION CLASSES  
    By V. Kann
    Date  October 1997
    Refs | Theme tree | Cited by 32 |  CiteSeer   (Authority Citation)

    14) MULTICAST TREE GENERATION IN NETWORKS WITH ASYMMETRIC LINKS  
    By S. Ramanathan
    Date  October 1998
    Refs | Theme tree | Cited by 24 |  CiteSeer   (Authority Citation)

    15) IDENTIFYING THE MINIMAL TRANSVERSALS OF A HYPERGRAPH AND RELATED PROBLEMS  
    By Georg Gottlob    Thomas Eiter
    Date  July 2000
    Refs | Theme tree | Cited by 58 |  CiteSeer  

    16) POLYNOMIAL TIME APPROXIMATION SCHEMES FOR DENSE INSTANCES OF NP-HARD PROBLEMS  
    By David Karger    Marek Karpinski    Sanjeev Arora
    Date  June 1998
    Refs | Theme tree | Cited by 93 |  CiteSeer  

    17) DIVIDE-AND-CONQUER APPROXIMATION ALGORITHMS VIA SPREADING METRICS  
    By Baruch Schieber    Guy Even    Joseph (seffi Naor    Satish Rao
    Date  February 1997
    Refs | Theme tree | Cited by 59 |  CiteSeer   (Authority Citation)

    18) GENETIC LOCAL SEARCH FOR THE TSP: NEW RESULTS  
    By Bernd Freisleben    Peter Merz
    Date  February 1997
    Refs | Theme tree | Cited by 36 |  CiteSeer   (Authority Citation)

    19) THE COMPLEXITY AND APPROXIMABILITY OF FINDING MAXIMUM FEASIBLE SUBSYSTEMS OF LINEAR RELATIONS  
    By Edoardo Amaldi    Viggo Kann
    Date  July 1996
    Refs | Theme tree | Cited by 38 |  CiteSeer   (Authority Citation)

    20) VERTEX COVER: FURTHER OBSERVATIONS AND FURTHER IMPROVEMENTS  
    By Iyad A. Kanj    Jianer Chen    Weijia Jia
    Date  July 2000
    Refs | Theme tree | Cited by 38 |  CiteSeer  

    21) A GENETIC LOCAL SEARCH ALGORITHM FOR SOLVING SYMMETRIC AND ASYMMETRIC TRAVELING SALESMAN PROBLEMS  
    By Bernd Freisleben    Peter Merz
    Date  December 1998
    Refs | Theme tree | Cited by 29 |  CiteSeer   (Authority Citation)

    22) TERMINOLOGICAL REASONING IS INHERENTLY INTRACTABLE  
    By Bernhard Nebel
    Date  June 1995
    Refs | Theme tree | Cited by 94 |  CiteSeer  

    23) BICRITERIA NETWORK DESIGN PROBLEMS  
    By Daniel Rosenkrantz    Ravi Sundaram
    Date  July 1999
    Refs | Theme tree | Cited by 40 |  CiteSeer  

    24) THE COMPLEXITY OF LOGIC-BASED ABDUCTION  
    By Georg Gottlob    Thomas Eiter
    Date  March 1995
    Refs | Theme tree | Cited by 59 |  CiteSeer  

    25) ON FINDING MULTI-CONSTRAINED PATHS  
    By Klara Nahrstedt    Shigang Chen
    Date  March 1998
    Refs | Theme tree | Cited by 33 |  CiteSeer  

  • Next 25 articles...