Journal of Combinatorial Optimization, Volume 3

Volume 3, Number 1, July 1999

• Zhaohui Liu, Wenci Yu:
  Minimizing the Number of Late Jobs under the Group Technology Assumption. 5-15
  
• Mauro Dell'Amico, Silvano Martello:
  Reduction of the Three-Partition Problem. 17-30
  
• Nanda Piersma:
  A Probabilistic Analysis of the Capacitated Facility Location Problem. 31-50
  
• Bettina Klinz, Gerhard J. Woeginger:
  The Steiner Tree Problem in Kalmanson Matrices and in Circulant Matrices. 51-58
  
• Hans Kellerer, Ulrich Pferschy:
  A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem. 59-71
  
• Keqin Li:
  Analysis of the List Scheduling Algorithm for Precedence Constrained Parallel Tasks. 73-88
  
• Hiroshi Iida:
  A Note on the Max-Min 0-1 Knapsack Problem. 89-94
  
• Mutsunori Yagiura, Toshihide Ibaraki:
  Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT. 95-114
  
• Mao-cheng Cai, Xiaoguang Yang, Yanjun Li:
  Inverse Polymatroidal Flow Problem. 115-126
  
• Jianzhong Zhang, Zhongfan Ma:
  Solution Structure of Some Inverse Combinatorial Optimization Problems. 127-139
  

Volume 3, Number 2-3, July 1999

• Ying Xu, Satoru Miyano, Tom Head:
  Foreword. 147-148
  
• Alberto Caprara:
  On the Tightness of the Alternating-Cycle Lower Bound for Sorting by Reversals. 149-182
  
• Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin:
  On the Complexity of Constructing Evolutionary Trees. 183-197
  
• Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang:
  Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices. 199-211
  
• Bin Ma, Lusheng Wang, Louxin Zhang:
  Fitting Distances by Tree Metrics with Increment Error. 213-225
  
• Yufang Hua, Tao Jiang, Bin Wu:
  Aligning DNA Sequences to Minimize the Change in Protein. 227-245
  
• Laxmi Parida, Aris Floratos, Isidore Rigoutsos:
  An Approximation Algorithm for Alignment of Multiple Sequences using Motif Discovery. 247-275
  
• Satoshi Kobayashi:
  Horn Clause Computation with DNA Molecules. 277-299
  
• Richard H. Lathrop, Michael J. Pazzani:
  Combinatorial Optimization in Rapidly Mutating Drug-Resistant Viruses. 301-320
  
• Tatsuya Akutsu:
  Approximation and Exact Algorithms for RNA Secondary Structure Prediction and Recognition of Stochastic Context-free Languages. 321-336
  

Volume 3, Number 4, December 1999

• Xiang-Yang Li, Shang-Hua Teng:
  Practical Human-Machine Identification over Insecure Channels. 347-361
  
• Klaus Jansen:
  An Approximation Scheme for Bin Packing with Conflicts. 363-377
  
• Philippe Galinier, Jin-Kao Hao:
  Hybrid Evolutionary Algorithms for Graph Coloring. 379-397
  
• Steven S. Seiden:
  Randomized Online Scheduling with Delivery Times. 399-416
  
• Martin Middendorf, Vadim G. Timkovsky:
  Transversal Graphs for Partially Ordered Sets: Sequencing, Merging and Scheduling Problems. 417-435
  
• Joachim Gudmundsson, Christos Levcopoulos:
  Close Approximations of Minimum Rectangular Coverings. 437-452
  
• Jie Wang:
  Packing of Unequal Spheres and Automated Radiosurgical Treatment Planning. 453-463
  
• Mao-cheng Cai:
  Inverse Problems of Matroid Intersection. 465-474
  

Last update Sat May 25 20:40:47 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page