@article{Whitley-Rowe/06,
AUTHOR = {Whitley, Darrell and Rowe, Jonathan},
TITLE = {Subthreshold-seeking local search},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {361},
NUMBER = {1},
PAGES = {2-17},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {local search, gray codes, no free lunch, subthreshold search},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4K126SH-3/2/7c416498cfc40e58c806546898550b60},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Arnold/06,
AUTHOR = {Arnold, Dirk V.},
TITLE = {Weighted multirecombination evolution strategies},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {361},
NUMBER = {1},
PAGES = {18-37},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {evolution strategies, optimization, weighted recombination, noise, cumulative step length adaptation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4K126SH-4/2/708db1c811ab601ba7751be3199d8023},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jagerskupper/06,
AUTHOR = {J{\"a}gersk{\"u}pper, Jens},
TITLE = {How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {361},
NUMBER = {1},
PAGES = {38-56},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {continuous optimization, evolutionary direct search method, probabilistic analysis of runtime},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4K126SH-6/2/9d5ea187bdf065e37063c061e5ab5e7f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Toussaint/06,
AUTHOR = {Toussaint, Marc},
TITLE = {Compact representations as a search strategy: Compression EDAs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {361},
NUMBER = {1},
PAGES = {57-71},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {estimation-of-distribution algorithms, factorial representations, compression, minimal description length, evolutionary algorithms, genotype-phenotype mapping},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4K126SH-1/2/ba63fbc50d7955b7d25ae9a10481639d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mitavskiy-Rowe/06,
AUTHOR = {Mitavskiy, Boris and Rowe, Jonathan},
TITLE = {Some results about the Markov chains associated to GPs and general EAs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {361},
NUMBER = {1},
PAGES = {72-110},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {evolutionary algorithms, markov chain, geiringer theorem, stationary distribution, mutation, crossover, fitness-proportional selection},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4K126SH-5/2/684f6118b0d56dbe0257c994a6631273},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Rowe-Vose-Wright/06,
AUTHOR = {Rowe, Jonathan E. and Vose, Michael D. and Wright, Alden H.},
TITLE = {Differentiable coarse graining},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {361},
NUMBER = {1},
PAGES = {111-129},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {differentiable, coarse graining, selection, mutation, form invariance},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4K126SH-2/2/e544d21e121633da3bf7e29e64532d66},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Marx/06d,
AUTHOR = {Marx, D{\'a}niel},
TITLE = {Minimum sum multicoloring on the edges of trees},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {361},
NUMBER = {2-3},
PAGES = {133-149},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {multicoloring, approximation scheme, edge coloring, trees},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4K4PVW7-5/2/e610634d54bcce98ec05173de453ff19},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Krysta-Lorys/06,
AUTHOR = {Krysta, Piotr and Lory{\'s}, Krzysztof},
TITLE = {Efficient approximation algorithms for the achromatic number},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {361},
NUMBER = {2-3},
PAGES = {150-171},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {approximation algorithms, graph coloring, achromatic number},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4K4WG3Y-1/2/c2ba3d5be61781b125f3a5e53cc379e1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Demaine-Emanuel-Fiat-Immorlica/06,
AUTHOR = {Demaine, Erik D. and Emanuel, Dotan and Fiat, Amos and Immorlica, Nicole},
TITLE = {Correlation clustering in general weighted graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {361},
NUMBER = {2-3},
PAGES = {172-187},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {clustering, partitioning, approximation algorithms, minimum multicut},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4K66BPP-1/2/f4a0392082d855cf60107da1e1c2c107},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gortz-Wirth/06,
AUTHOR = {G{\o}rtz, Inge Li and Wirth, Anthony},
TITLE = {Asymmetry in $k$-center variants},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {361},
NUMBER = {2-3},
PAGES = {188-199},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {k-center, asymmetric, approximation algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4K4PVW7-4/2/238906a634067c6b8fe1acb914f0ea18},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Awerbuch-Azar-Richter-Tsur/06,
AUTHOR = {Awerbuch, Baruch and Azar, Yossi and Richter, Yossi and Tsur, Dekel},
TITLE = {Tradeoffs in worst-case equilibria},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {361},
NUMBER = {2-3},
PAGES = {200-209},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {worst-case coordination ratio, restricted assignment, unrelated links},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4K4PVW7-3/2/136cf76038f4861fcdcd0c311d9ddc7b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{de_Klerk-Laurent-Parrilo/06,
AUTHOR = {de Klerk, Etienne and Laurent, Monique and Parrilo, Pablo A.},
TITLE = {A PTAS for the minimization of polynomials of fixed degree over the simplex},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {361},
NUMBER = {2-3},
PAGES = {210-225},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {semidefinite programming, global optimization, positive polynomial, sum of squares of polynomials, approximation algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4K4WFH8-1/2/607ae83a51e7241fdf8797abf8b5fe77},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Decker-Lucking-Monien/06,
AUTHOR = {Decker, T. and L{\"u}cking, T. and Monien, B.},
TITLE = {A $\frac{5}{4}$-approximation algorithm for scheduling identical malleable tasks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {361},
NUMBER = {2-3},
PAGES = {226-240},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {scheduling, approximation algorithms, malleable jobs},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4K5SS23-2/2/ccb773d0e75631c099e220fd4016eb83},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Uma-Wein-Williamson/06,
AUTHOR = {Uma, R.N. and Wein, Joel and Williamson, David P.},
TITLE = {On the relationship between combinatorial and LP-based lower bounds for $NP$-hard scheduling problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {361},
NUMBER = {2-3},
PAGES = {241-256},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorial lower bounds, lp-based lower bounds, scheduling},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4K605KK-2/2/95e0a309ccf942df7f5707b292ae6819},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ageev-Fishkin-Kononov-Sevastyanov/06,
AUTHOR = {Ageev, A.A. and Fishkin, A.V. and Kononov, A.V. and Sevastyanov, S.V.},
TITLE = {Open block scheduling in optical communication networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {361},
NUMBER = {2-3},
PAGES = {257-274},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {scheduling, approximation, open shop, data packets},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4K4WFH8-3/2/ce3ede41963bafbd490d366391516b4f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fotakis/06a,
AUTHOR = {Fotakis, Dimitris},
TITLE = {Incremental algorithms for Facility Location and $k$-median},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {361},
NUMBER = {2-3},
PAGES = {275-313},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {online algorithms, facility location, incremental clustering},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4K4WFH8-4/2/bc9b023de1eeaf79f1eb2e6bfd44c744},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Azar-Epstein-Epstein/06,
AUTHOR = {Azar, Yossi and Epstein, Amir and Epstein, Leah},
TITLE = {Load balancing of temporary tasks in the $l_p$ norm},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {361},
NUMBER = {2-3},
PAGES = {314-328},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {online algorithms, competitive ratio, load balancing, temporary tasks, lp norm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4K4WG3Y-2/2/74efae835c39ad6b36bee83bfd6e15f9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gutierrez-Krumke-Megow-Vredeveld/06,
AUTHOR = {Guti{\'e}rrez, Sandra and Krumke, Sven O. and Megow, Nicole and Vredeveld, Tjark},
TITLE = {How to whack moles},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {361},
NUMBER = {2-3},
PAGES = {329-341},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {online algorithms, competitive analysis, np-hardness, dynamic programming},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4K4WG3Y-3/2/3a235babb8cdedc85b53c7a318e06e53},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Demaine-Fekete-Gal/06,
AUTHOR = {Demaine, Erik D. and Fekete, Sandor P. and Gal, Shmuel},
TITLE = {Online searching with turn cost},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {361},
NUMBER = {2-3},
PAGES = {342-355},
YEAR = {2006},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {online problems, search games, linear-search problem, star search, cow-path problem, turn cost, competitive ratio, infinite linear programs, randomized strategies},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4K4WFH8-2/2/78e9ec4dd2add4262ecd26b62cbbdb4d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}