default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Optimization, Volume 5
Volume 5, Number 1, March 2001
- Jie Wang:
Optimization Problems in Medical Applications. 7-8 - Leonidas D. Iasemidis
, Panos M. Pardalos, J. Chris Sackellares, Deng-Shan Shiau:
Quadratic Binary Programming and Dynamical System Approach to Determine the Predictability of Epileptic Seizures. 9-26 - Ingela Nyström, Örjan Smedby:
Skeletonization of Volumetric Vascular Images - Distance Information Utilized for Visualization. 27-41 - Peter Hall:
On the Addition and Comparison of Graphs Labeled with Stochastic Variables: Learnable Anatomical Catalogs. 43-58 - Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Xiaodong Wu, Jinhui Xu:
Determining an Optimal Penetration Among Weighted Regions in Two and Three Dimensions. 59-79 - Alan P. Sprague, Stephen E. Brossette:
Medical Surveillance, Frequent Sets, and Closure Operations. 81-94 - Peng Zhao, Tao Jiang:
A Heuristic Algorithm for Multiple Sequence Alignment Based on Blocks. 95-115 - Sanguthevar Rajasekaran, H. Nick, Panos M. Pardalos, Sartaj Sahni, G. Shaw:
Efficient Algorithms for Local Alignment Search. 117-124 - Sanguthevar Rajasekaran, Y. Hu, Jun Luo, H. Nick, Panos M. Pardalos, Sartaj Sahni, G. Shaw:
Efficient Algorithms for Similarity Search. 125-132 - Li Sheng, Chi Wang, Peisen Zhang:
Tagged Probe Interval Graphs. 133-142
Volume 5, Number 2, June 2001
- John E. Mitchell:
Restarting after Branching in the SDP Approach to MAX-CUT and Similar Combinatorial Optimization Problems. 151-166 - Daya Ram Gaur, Ramesh Krishnamurti:
Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability. 167-173 - Hiroshi Nagamochi, Takashi Shiraki, Toshihide Ibaraki:
Augmenting a Submodular and Posi-modular Set Function by a Multigraph. 175-212 - Tetsuo Asano, Naoki Katoh, Kazuhiro Kawashima:
A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree. 213-231 - Piotr Krysta, Roberto Solis-Oba:
Approximation Algorithms for Bounded Facility Location Problems. 233-247 - Yoshiyuki Kusakari, Daisuke Masubuchi, Takao Nishizeki:
Finding a Noncrossing Steiner Forest in Plane Graphs Under a 2-Face Condition. 249-266
Volume 5, Number 3, September 2001
- Ján Plesník:
Minimum Cost Edge Subset Covering Exactly k Vertices of a Graph. 275-286 - Pierluigi Crescenzi, Xiaotie Deng, Christos H. Papadimitriou:
On Approximating a Scheduling Problem. 287-297 - Adam N. Letchford:
On Disjunctive Cuts for Combinatorial Optimization. 299-315 - Robert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh:
A 2\frac{1}{10}-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem. 317-326 - Xiuzhen Cheng, Joon-Mo Kim, Bing Lu:
A Polynomial Time Approximation Scheme for the Problem of Interconnecting Highways. 327-343 - Shyh-In Hwang, Sheng-Tzong Cheng:
Combinatorial Optimization in Real-Time Scheduling: Theory and Algorithms. 345-375
Volume 5, Number 4, December 2001
- Mauricio G. C. Resende:
"Mobile Networks and Computing". 297-298 - Xiaotie Deng, Evangelos E. Milios, Andranik Mirzaian:
Robot Map Verification of a Graph World. 383-395 - Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki:
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts. 397-410 - Hing-Yip Lau, H. F. Ting:
The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent. 411-420 - J. MacGregor Smith, Wu-Ji Li:
Quadratic Assignment Problems and M/G/C/C/ State Dependent Network Flows. 421-443 - Nodari Vakhania:
Tight Performance Bounds of CP-Scheduling on Out-Trees. 445-464 - Mhand Hifi, Catherine Roucairol:
Approximate and Exact Algorithms for Constrained (Un) Weighted Two-dimensional Two-staged Cutting Stock Problems. 465-494 - Mauricio G. C. Resende:
Multichannel Optical Networks: Theory and Practice. 495-496
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 22:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
