Experimental and Efficient Algorithms Book

	Improving Linear Programming Approaches for the Steiner Tree Problem	1
	Algorithms and Experiments on Colouring Squares of Planar Graphs	15
	Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem	33
	Fast-Search: A New Efficient Variant of the Boyer-Moore String Matching Algorithm	47
	An On-Line Algorithm for the Rectangle Packing Problem with Rejection	59
	New Lower and Upper Bounds for Graph Treewidth	70
	Search Data Structures for Skewed Strings	81
	Evaluation of Basic Protocols for Optical Smart Dust Networks	97
	Linear Time Local Improvements for Weighted Matchings in Graphs	107
	Experimental Studies of Graph Traversal Algorithms	120
	A Nondifferentiable Optimization Approach to Ratio-Cut Partitioning	134
	Comparing Push- and Pull-Based Broadcasting or: Would "Microsoft Watches" Profit from a Transmitter?	148
	Experimental Comparison of Heuristic and Approximation Algorithms for Uncapacitated Facility Location	165
	A Lazy Version of Eppstein's K Shortest Paths Algorithm	179
	Linear Algorithm for 3-Coloring of Locally Connected Graphs	191
	A Clustering Algorithm for Interval Graph Test on Noisy Data	195
	Core Instances for Testing: A Case Study	209
	The Reliable Algorithmic Software Challenge RASC	222
	A New Class of Greedy Heuristics for Job Shop Scheduling Problems	223
	Algorithmic Techniques for Memory Energy Reduction	237
	A Framework for Designing Approximation Algorithms for Scheduling Problems	253
	Analysis and Visualization of Social Networks	261
	Author Index	267