@article{Fiol-Garriga/02,
AUTHOR = {Fiol, M.A. and Garriga, E.},
TITLE = {An algebraic characterization of completely regular codes in distance-regular graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {1},
PAGES = {1-13},
YEAR = {2001-2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {distance-regular graph, local spectrum, orthogonal polynomials, completely regular code, edge-distance-regularity},
URL = {http://dx.doi.org/10.1137/S0895480100376496},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Blackmore-Norton/02,
AUTHOR = {Blackmore, T. and Norton, G.H.},
TITLE = {Determining when the absolute state complexity of a Hermitian code achieves its DLP bound},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {1},
PAGES = {14-40},
YEAR = {2001-2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {hermitian code, state complexity, dimension/length profile bound},
URL = {http://dx.doi.org/10.1137/S0895480100376435},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Hanckowiak-Karonski-Panconesi/02,
AUTHOR = {Ha{\'n}{\'c}kowiak, Micha{\l} and Karo{\'n}ski, Micha{\l} and Panconesi, Alessandro},
TITLE = {On the distributed complexity of computing maximal matchings},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {1},
PAGES = {41-57},
YEAR = {2001-2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {graph algorithms, distributed, synchronous, deterministic},
URL = {http://dx.doi.org/10.1137/S0895480100373121},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Alon-Sudakov-Zwick/02,
AUTHOR = {Alon, Noga and Sudakov, Benny and Zwick, Uri},
TITLE = {Constructing worst case instances for semidefinite programming based approximation algorithms},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {1},
PAGES = {58-72},
YEAR = {2001-2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {max cut, semidefinite programming, approximation algorithm},
URL = {http://dx.doi.org/10.1137/S0895480100379713},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Dolev-Harari-Linial-Nisan-Parnas/02,
AUTHOR = {Dolev, Danny and Harari, Yuval and Linial, Nathan and Nisan, Noam and Parnas, Michal},
TITLE = {Neighborhood preserving hashing and approximate queries},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {1},
PAGES = {73-85},
YEAR = {2001-2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {approximate query, hashing, isoperimetric inequality, error correcting code},
URL = {http://dx.doi.org/10.1137/S089548019731809X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Wang/02d,
AUTHOR = {Wang, Hong},
TITLE = {On covering a bipartite graph with cycles},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {1},
PAGES = {86-96},
YEAR = {2001-2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {bipartite graphs, cycles, coverings},
URL = {http://dx.doi.org/10.1137/S0895480196310487},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Zelikovsky-Mandoiu/02,
AUTHOR = {Zelikovsky, Alexander Z. and Mandoiu, Ion I.},
TITLE = {Practical approximation algorithms for zero- and bounded-skew trees},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {1},
PAGES = {97-111},
YEAR = {2001-2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {steiner trees, clock routing, vlsi physical design, approximation algorithms},
URL = {http://dx.doi.org/10.1137/S0895480100378367},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Doignon-Fiorini/02,
AUTHOR = {Doignon, Jean-Paul and Fiorini, Samuel},
TITLE = {Facets of the weak order polytope derived from the induced partition projection},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {1},
PAGES = {112-121},
YEAR = {2001-2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {weak order polytope, partition polytope, facet of convex polytope},
URL = {http://dx.doi.org/10.1137/S0895480100369936},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Garnier-Kallel/02,
AUTHOR = {Garnier, Josselin and Kallel, Leila},
TITLE = {Efficiency of local search with multiple local optima},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {1},
PAGES = {122-141},
YEAR = {2001-2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {combinatorial complexity, local search, neighborhood graph, randomized starting solution},
URL = {http://dx.doi.org/10.1137/S0895480199355225},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Borodin-Woodall/02,
AUTHOR = {Borodin, Oleg V. and Woodall, Douglas R.},
TITLE = {Cyclic colorings of 3-polytopes with large maximum face size},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {2},
PAGES = {143-154},
YEAR = {2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {cyclic coloring, cyclic chromatic number, 3-polytope, plane graph},
URL = {http://dx.doi.org/10.1137/S089548019630248X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Barg/02,
AUTHOR = {Barg, Alexander},
TITLE = {On some polynomials related to weight enumerators of linear codes},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {2},
PAGES = {155-164},
YEAR = {2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {all-terminal reliability, greene's theorem, linear code, linear matroid, potts model, rank polynomial, tutte polynomial, weight enumerator},
URL = {http://dx.doi.org/10.1137/S0895480199364148},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Goemans-Queyranne-Schulz-Skutella-Wang/02,
AUTHOR = {Goemans, Michel X. and Queyranne, Maurice and Schulz, Andreas S. and Skutella, Martin and Wang, Yaoguang},
TITLE = {Single machine scheduling with release dates},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {2},
PAGES = {165-192},
YEAR = {2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {approximation algorithm, lp relaxation, scheduling, on-line algorithm},
URL = {http://dx.doi.org/10.1137/S089548019936223X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Wang/02e,
AUTHOR = {Wang, Biing-Feng},
TITLE = {Finding a 2-core of a tree in linear time},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {2},
PAGES = {193-210},
YEAR = {2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {graphs, algorithms, trees, cores, network location theory, parallel algorithms},
URL = {http://dx.doi.org/10.1137/S0895480100374242},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Alon-Krivelevich/02,
AUTHOR = {Alon, Noga and Krivelevich, Michael},
TITLE = {Testing $k$-colorability},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {2},
PAGES = {211-227},
YEAR = {2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {graph coloring, property testing},
URL = {http://dx.doi.org/10.1137/S0895480199358655},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Honkala-Klapper/02,
AUTHOR = {Honkala, Iiro and Klapper, Andrew},
TITLE = {Multicovering bounds from relative covering radii},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {2},
PAGES = {228-234},
YEAR = {2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {covering radius, multicovering radius, coding theory, hamming codes},
URL = {http://dx.doi.org/10.1137/S089548010037935X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Klavzar-Mulder/02,
AUTHOR = {Klav{\v{z}}ar, Sandi and Mulder, Henry Martyn},
TITLE = {Partial cubes and crossing graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {2},
PAGES = {235-251},
YEAR = {2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {isometric subgraph, hypercube, partial cube, crossing graph, median graph, triangle-free graph, cartesian product of graphs},
URL = {http://dx.doi.org/10.1137/S0895480101383202},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Berman-DasGupta-Muthukrishnan/02,
AUTHOR = {Berman, Piotr and DasGupta, Bhaskar and Muthukrishnan, S.},
TITLE = {Exact size of binary space partitionings and improved rectangle tiling algorithms},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {2},
PAGES = {252-267},
YEAR = {2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {binary space partitions, exact bounds, tiling, approximation algorithms},
URL = {http://dx.doi.org/10.1137/S0895480101384347},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Bandelt-Chepoi/02,
AUTHOR = {Bandelt, Hans-J{\"u}rgen and Chepoi, Victor},
TITLE = {Graphs with connected medians},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {2},
PAGES = {268-282},
YEAR = {2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {graphs, medians, local medians, majority rule, lp duality},
URL = {http://dx.doi.org/10.1137/S089548019936360X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Rizzi/02,
AUTHOR = {Rizzi, Romeo},
TITLE = {Finding 1-factors in bipartite regular graphs and edge-coloring bipartite graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {3},
PAGES = {283-288},
YEAR = {2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {time-tabling, edge-coloring, perfect matching, regular bipartite graphs},
URL = {http://dx.doi.org/10.1137/S0895480199351136},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Ranto/02,
AUTHOR = {Ranto, Kalle},
TITLE = {Infinite families of 3-designs from $Z_4$-Goethals codes with block size 8},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {3},
PAGES = {289-304},
YEAR = {2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {$t$-design, goethals code, quaternary code, kloosterman sum},
URL = {http://dx.doi.org/10.1137/S0895480101385882},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Du-Hwang-Jia-Ngo/02,
AUTHOR = {Du, Ding-Zhu and Hwang, Frank K. and Jia, Xiaohua and Ngo, Hung Q.},
TITLE = {Optimal consecutive-$k$-out-of-$n$: $G$ cycle for $n \le 2k+1$},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {3},
PAGES = {305-316},
YEAR = {2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {invariant optimal assignment, consecutive-$k$-out-of-$n$: $g$ cycle},
URL = {http://dx.doi.org/10.1137/S0895480100375041},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Ashir-Stewart/02,
AUTHOR = {Ashir, Yaagoub A. and Stewart, Iain A.},
TITLE = {Fault-tolerant embeddings of Hamiltonian circuits in $k$-ary $n$-cubes},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {3},
PAGES = {317-328},
YEAR = {2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {hamiltonian circuits, embeddings, fault-tolerance, $k$-ary $n$-cubes, np-completeness},
URL = {http://dx.doi.org/10.1137/S0895480196311183},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Cornuejols-Guenin/02,
AUTHOR = {Cornu{\'e}jols, G{\'e}rard and Guenin, Bertrand},
TITLE = {Ideal binary clutters, connectivity, and a conjecture of Seymour},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {3},
PAGES = {329-352},
YEAR = {2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {ideal clutter, signed matroid, multicommodity flow, weakly bipartite graph, $t$-cut, seymour's conjecture, connectivity, separation},
URL = {http://dx.doi.org/10.1137/S0895480100371389},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Deogun-Kratsch/02,
AUTHOR = {Deogun, Jitender S. and Kratsch, Dieter},
TITLE = {Dominating pair graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {3},
PAGES = {353-366},
YEAR = {2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {algorithms, graph classes, asteroidal triple-free graphs, dominating pair graphs},
URL = {http://dx.doi.org/10.1137/S0895480100367111},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kitchens/02,
AUTHOR = {Kitchens, Bruce},
TITLE = {Multidimensional convolutional codes},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {3},
PAGES = {367-381},
YEAR = {2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {convolutional codes, algebraic codes, multidimensional codes},
URL = {http://dx.doi.org/10.1137/S0895480100378495},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Fishburn-Wright/02,
AUTHOR = {Fishburn, Peter C. and Wright, Paul E.},
TITLE = {Interference patterns in regular graphs with bijective colorings},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {3},
PAGES = {382-402},
YEAR = {2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {bijective graph coloring, regular graphs, interference, channel assignment},
URL = {http://dx.doi.org/10.1137/S0895480100382342},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Schrijver/02a,
AUTHOR = {Schrijver, Alexander},
TITLE = {Strong $t$-perfection of bad-$K_4$-free graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {3},
PAGES = {403-415},
YEAR = {2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {t-perfect, graph, stable set, polytope},
URL = {http://dx.doi.org/10.1137/S0895480101401101},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Peleg-Wool/02,
AUTHOR = {Peleg, David and Wool, Avishai},
TITLE = {How to be an efficient snoop, or the probe complexity of quorum systems},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {3},
PAGES = {416-433},
YEAR = {2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {quorum systems, distributed computing, evasiveness, strong and simple games},
URL = {http://dx.doi.org/10.1137/S0895480198343819},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kratsch-Stewart/02,
AUTHOR = {Kratsch, D. and Stewart, L.},
TITLE = {Approximating bandwidth by mixing layouts of interval graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {4},
PAGES = {435-449},
YEAR = {2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {interval graphs, circular-arc graphs, chordal graphs, polygon graphs, bandwidth problem, approximation algorithm},
URL = {http://dx.doi.org/10.1137/S0895480199359624},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Schulz-Skutella/02,
AUTHOR = {Schulz, Andreas S. and Skutella, Martin},
TITLE = {Scheduling unrelated machines by randomized rounding},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {4},
PAGES = {450-469},
YEAR = {2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {approximation algorithm, randomized rounding, linear programming relaxation, scheduling, on-line algorithm},
URL = {http://dx.doi.org/10.1137/S0895480199357078},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Cheng-de_Vries/02,
AUTHOR = {Cheng, Eddie and de Vries, Sven},
TITLE = {On the facet-inducing antiweb-wheel inequalities for stable set polytopes},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {4},
PAGES = {470-487},
YEAR = {2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {stable sets, polyhedral combinatorics, cutting planes, facets, wheels, antiwebs},
URL = {http://dx.doi.org/10.1137/S0895480101391053},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Hsieh-Ho-Hsu-Ko-Chen/02,
AUTHOR = {Hsieh, Sun-Yuan and Ho, Chin-Wen and Hsu, Tsan-Sheng and Ko, Ming-Tat and Chen, Gen-Huey},
TITLE = {Characterization of efficiently parallel solvable problems on distance-hereditary graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {4},
PAGES = {488-518},
YEAR = {2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {algorithms, data structures, distance-hereditary graphs, parallel random access machine, subgraph optimization problems},
URL = {http://dx.doi.org/10.1137/S0895480101389880},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Haynes-Hedetniemi-Hedetniemi-Henning/02,
AUTHOR = {Haynes, Teresa W. and Hedetniemi, Sandra M. and Hedetniemi, Stephen T. and Henning, Michael A.},
TITLE = {Domination in graphs applied to electric power networks},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {4},
PAGES = {519-529},
YEAR = {2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {domination, power domination, electric power monitoring},
URL = {http://dx.doi.org/10.1137/S0895480100375831},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Hassin-Rubinstein/02a,
AUTHOR = {Hassin, Refael and Rubinstein, Shlomi},
TITLE = {Robust matchings},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {4},
PAGES = {530-537},
YEAR = {2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {robust matching, maximum clustering},
URL = {http://dx.doi.org/10.1137/S0895480198332156},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Wang-Lih/02,
AUTHOR = {Wang, Wei-Fan and Lih, Ko-Wei},
TITLE = {Choosability and edge choosability of planar graphs without intersecting triangles},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {4},
PAGES = {538-545},
YEAR = {2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {choosability, edge choosability, planar graph},
URL = {http://dx.doi.org/10.1137/S0895480100376253},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Sawada/02,
AUTHOR = {Sawada, Joe},
TITLE = {A fast algorithm for generating nonisomorphic chord diagrams},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {4},
PAGES = {546-561},
YEAR = {2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {chord diagram, generation algorithm, enumeration, necklace},
URL = {http://dx.doi.org/10.1137/S0895480100377970},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Steel-Szekely/02,
AUTHOR = {Steel, Michael A. and Sz{\'e}kely, L{\'a}szl{\'o} A.},
TITLE = {Inverting random functions II: Explicit bounds for discrete maximum likelihood estimation, with applications},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {15},
NUMBER = {4},
PAGES = {562-575},
YEAR = {2002},
EDITOR = {Shmoys, David B.},
KEYWORDS = {random function, maximum likelihood estimation, kullback--leibler distance, phylogeny reconstruction},
URL = {http://dx.doi.org/10.1137/S089548010138790X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}