default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Optimization, Volume 12
Volume 12, Numbers 1-2, September 2006
- Mohit Lad, Daniel Massey, Adam Meyerson, Akash Nanavati, Lixia Zhang:
Minimum failure explanations for path vector routing changes. 5-16 - Yigal Bejerano, Joseph Naor, Alexander Sprintson
:
Efficient algorithms for shared backup allocation in networks with partial information. 17-34 - Qunwei Zheng, Sibabrata Ray, Xiaoyan Hong:
Resource allocation for restoration of compromised systems. 35-56 - Anders Hansson, Gabriel Istrate, Shiva Prasad Kasiviswanathan:
Combinatorics of TCP reordering. 57-70 - Yuan Cao, Oliver Yu:
Optimization of loss-balanced multicast in all-optical WDM networks. 71-82 - Randeep Bhatia, Murali S. Kodialam, T. V. Lakshman:
Finding disjoint paths with related path costs. 83-96 - Shekhar Srivastava, Deep Medhi:
Traffic engineering of tunnel-based networks with class specific diversity requirements. 97-125 - Weijia Jia, Hanxing Wang, Wanqing Tu, Wei Zhao:
A New delay control method for real-time flows. 127-149 - Chonggang Wang, Yu Lin, Kazem Sohraby, Bo Li:
An adaptive algorithm for active queue management. 151-162
Volume 12, Number 3, November 2006
- Jinchang Wang, Thomas Kämpke:
The fastest itinerary in time-dependent decentralized travel information systems. 167-185 - Eranda Çela, Bettina Klinz, Christophe Meyer:
Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem. 187-215 - Chia-Mao Huang, Bang Ye Wu, Chang-Biau Yang:
Tree edge decomposition with an application to minimum ultrametric tree approximation. 217-230 - Enock Chisonge Mofya, J. Cole Smith:
Exact and heuristic algorithms for solving the generalized minimum filter placement problem. 231-256 - Rashika Gupta, Manju Agarwal:
Penalty guided genetic search for redundancy optimization in multi-state series-parallel power system. 257-277 - Mikhail Y. Kovalyov, Marie-Claude Portmann, Ammar Oulamara:
Optimal testing and repairing a failed series system. 279-295 - Hong Gao, Frank K. Hwang, My T. Thai, Weili Wu, Taieb Znati:
Construction of d(H)-disjunct matrix for group testing in hypergraphs. 297-301 - Wayne J. Pullan:
Phased local search for the maximum clique problem. 303-323
Volume 12, Number 4, December 2006
- Guohui Lin, Zhiyi Tan:
Editorial: In memoriam: Yong He (1969-2005). 325-326 - Guangting Chen, Gu Zhang, Rainer E. Burkard:
The web proxy location problem in general tree of rings networks. 327-336 - György Dósa, Yong He:
Scheduling with machine cost and rejection. 337-350 - Binwu Zhang, Jianzhong Zhang, Liqun Qi:
The shortest path improvement problems under Hamming distance. 351-361 - Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt:
Separating online scheduling algorithms with the relative worst order ratio. 363-386 - C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan:
A note on the complexity of the problem of two-agent scheduling on a single machine. 387-394 - Longcheng Liu, Jianzhong Zhang:
Inverse maximum flow problems under the weighted Hamming distance. 395-408 - Haiyan Lu, Weiqi Chen:
Dynamic-objective particle swarm optimization for constrained optimization problems. 409-419 - Chen Ting, H. E. Yong:
Optimal algorithms for uncovering synteny problem. 421-432
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 2024-12-23 19:36 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:
