Titlebook: Algorithms -- ESA 2004; 12th Annual European Susanne Albers,Tomasz Radzik Conference proceedings 2004 Springer-Verlag Berlin Heidelberg 200

Deduct

Modeling Locality: A Probabilistic Analysis of LRU and FWFproperties of paging assessed by practical experience. In particular, the competitive ratios of paging algorithms that are known to be efficient in practice (e.g. LRU) are as poor as those of naive heuristics (e.g. FWF). It has been recognized that the main reason for these discrepancies lies in an

Terminal

An Algorithm for Computing DNA Walksns of poor coverage. Finishing by walks is a process by which the DNA in these regions is resequenced. Selective sequencing is expensive and time consuming. Therefore, the laboratory process of finishing is modeled as an optimization problem aimed at minimizing laboratory cost. We give an algorithm

Promotion

言外之意

本能

A Parameterized Algorithm for Upward Planarity Testingf the algorithms for upward planarity testing developed previously focused on special classes of graphs. In this paper we develop a parameterized algorithm for upward planarity testing that can be applied to all graphs and runs in .(.(.).. + .(.,ℓ).) time, where . is the number of vertices, . is the

Assault

Fisher Equilibrium Price with a Class of Concave Utility Functionse logarithmic utility functions. We derive a duality relation between buyers and sellers under such utility functions, and use it to design a polynomial time algorithm for calculating equilibrium price, for the special case when either the number of sellers or the number of buyers is bounded by a co

eustachian-tube

Hardness and Approximation Results for Packing Steiner Treest Steiner trees of undirected graphs, we show APX-hardness for 4 terminals. For packing Steiner-node-disjoint Steiner trees of undirected graphs, we show a logarithmic hardness result, and give an approximation guarantee of ., where . denotes the number of nodes. For the directed setting (packing ed

蛰伏

Approximation Hardness of Dominating Set Problemsounds for various kinds of domination problems (connected, total, independent) in bounded degree graphs. For most of dominating set problems we prove asymptotically almost tight lower bounds. The results are applied to improve the lower bounds for other related problems such as the . problem and the

excursion

Limpid