Algorithms - ESA 2001: 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, ProceedingsFriedhelm Meyer auf der Heide It is only during the last decade that the functions of sinusoidal endothelial cells, Kupffer cells, hepatic stellate cells, pit cells and other intrahepatic lymphocytes have been better understood. The development of methods for isolation and co-culturing various types of liver cells has established that they communicate and cooperate via secretion of various intercellular mediators. This monograph summarizes multiple data that suggest the important role of cellular cross-talk for the functions of both normal and diseased liver. Special features of the book include concise presentation of the majority of detailed data in 19 tables. Original schemes allow for the clear illustration of complicated intercellular relationships. This is the first ever presentation of the newly emerging field of liver biology, which is important for hepatic function in health and disease and opens new avenues for therapeutic interventions. |
Contents
External Memory Data Structures | 1 |
Some Algorithmic Problems in Large Networks | 30 |
Exact and Approximate Distances in Graphs A Survey | 33 |
Strongly Competitive Algorithms for Caching with Pipelined Prefetching | 49 |
Duality between Prefetching and Queued Writing with Parallel Disks | 62 |
Online Bin Coloring | 74 |
A General Decomposition Theorem for the kServer Problem | 86 |
Buying a Constant Competitive Ratio for Paging | 98 |
Explicit Deterministic Constructions for Membership in the Bitprobe Model | 290 |
Lossy Dictionaries | 300 |
Splitting a Delaunay Triangulation in Linear Time | 312 |
A Fast Algorithm for Approximating the Detour of a Polygonal Chain | 321 |
An Approximation Algorithm for MINIMUM CONVEX COVER with Logarithmic Performance Guarantee | 333 |
Distributed EdgeColoring Algorithm | 345 |
Narrowing the Gap between Analysis and Simulation | 356 |
Computing Cycle Covers without Short Cycles | 368 |
Simple Minimal Perfect Hashing in Less Space | 109 |
Cuckoo Hashing | 121 |
Coupling Variable Fixing Algorithms for the Automatic Recording Problem | 134 |
Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints | 146 |
On the Approximability of the Minimum Test Collection Problem | 158 |
Finding Approximate Repetitions under Hamming Distance | 170 |
SNPs Problems Complexity and Algorithms | 182 |
A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs | 194 |
Simpler and Faster | 206 |
A 2Approximation Algorithm for the Multivehicle Scheduling Problem on a Path with Release and Handling Times | 218 |
A Simple Shortest Path Algorithm with Linear Average Time | 230 |
A Heuristic for Dijkstras Algorithm with Many Targets and Its Use in Weighted Matching Algorithms | 242 |
A Separation Bound for Real Algebraic Expressions | 254 |
Property Testing with Geometric Queries | 266 |
Smallest ColorSpanning Objects | 278 |
A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth | 380 |
Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows | 391 |
SingleStock and Basket Options | 404 |
Competitive Auctions for Multiple Digital Goods | 416 |
Algorithms for Efficient Filtering in ContentBased Multicast | 428 |
Approximation Algorithms for MinimumTime Broadcast under the VertexDisjoint Paths Mode | 440 |
Round Robin Is Optimal for FaultTolerant Broadcasting on Wireless Networks | 452 |
Online and Offline Distance Constrained Labeling of Disk Graphs | 464 |
Approximate Distance Labeling Schemes | 476 |
On the Parameterized Complexity of Layered Graph Drawing | 488 |
A General Model of Undirected Web Graphs | 500 |
Packing Cycles and Cuts in Undirected Graphs | 512 |
Greedy Algorithms for Minimisation Problems in Random Regular Graphs | 524 |
| 537 | |
Other editions - View all
Algorithms - ESA 2001: 9th Annual European Symposium, Aarhus, Denmark ... Friedhelm Meyer auf der Heide No preview available - 2001 |
Common terms and phrases
approximation algorithm assume auction B-trees block bucket cache colors competitive ratio complete Computer Science consider constant construction contains convex polygon cost cycle data structures decomposition defined denote directed graphs disk graph distance labeling scheme edge weights efficient elements factor given graph G Graph Partitioning hash functions I/Os input insert integer least Lemma linear LNCS lower bound machines makespan maximal maximum minimal minimum multicast node NP-hard O(log obtain offline online algorithm operations optimal pair parallel partition perfect hash function performance phase planar planar graphs points polynomial prefetching Proc Proof protocol query queue random randomized algorithm rectangle repetitions running schedule Section sequence set covering set covering problem shortest paths solution solved space subgraph subset Symposium test collection problem Theorem tree unit disk graph upper bound variable vertex vertices