Experimental and Efficient Algorithms Book

	A hybrid bin-packing heuristic to multiprocessor scheduling	1
	Efficient edge-swapping heuristics for finding minimum fundamental cycle bases	14
	Solving chance-constrained programs combining Tabu search and simulation	30
	An algorithm to identify clusters of solutions in multimodal optimisation	42
	On an experimental algorithm for revenue management for cargo airlines	57
	Cooperation between branch and bound and evolutionary approaches to solve a bi-objective flow shop problem	72
	Simple max-cut for split-indifference graphs and graphs with few P[subscript 4]'s	87
	A randomized heuristic for scene recognition by graph matching	100
	An efficient implementation of a joint generation algorithm	114
	Lempel, Even, and Cederbaum planarity method	129
	A greedy approximation algorithm for the uniform labeling problem analyzed by a primal-dual technique	145
	Distributed circle formation for anonymous oblivious robots	159
	Dynamic programming and column generation based approaches for two-dimensional guillotine cutting problems	175
	Engineering shortest path algorithms	191
	How to tell a good neighborhood from a bad one : satisfiability of Boolean formulas	199
	Implementing approximation algorithms for the single-source unsplittable flow problem	213
	Fingered multidimensional search trees	228
	Faster deterministic and randomized algorithms on the homogeneous set sandwich problem	243
	Efficient implementation of the BSP/CGM parallel vertex cover FPT algorithm	253
	Combining speed-up techniques for shortest-path computations	269
	Increased bit-parallelism for approximate string matching	285
	The role of experimental algorithms in genomics	299
	A fast algorithm for constructing suffix arrays for fixed-size alphabets	301
	Pre-processing and linear-decomposition algorithm to solve the k-colorability problem	315
	An experimental study of unranking algorithms	326
	An improved derandomized approximation algorithm for the max-controlled set problem	341
	GRASP with path-relinking for the quadratic assignment problem	356
	Finding minimum transmission radii for preserving connectivity and constructing minimal spanning trees in ad hoc and sensor networks	369
	A dynamic algorithm for topologically sorting directed acyclic graphs	383
	Approximating interval coloring and max-coloring in chordal graphs	399
	A statistical approach for algorithm selection	417
	An improved time-sensitive metaheuristic framework for combinatorial optimization	432
	A Huffman-based error detecting code	446
	Solving diameter constrained minimum spanning tree problems in dense graphs	458
	An efficient Tabu search heuristic for the school timetabling problem	468
	Experimental studies of symbolic shortest-path algorithms	482
	Experimental comparison of greedy randomized adaptive search procedures for the maximum diversity problem	498
	Using compact tries for cache-efficient sorting of integers	513
	Using random sampling to build approximate tries for efficient string sorting	529
	The datapath merging problem in reconfigurable systems : lower bounds and heuristic evaluation	545
	An analytical model for energy minimization	559
	A heuristic for minimum-width graph layering with consideration of dummy nodes	570