Titlebook: Algorithms - ESA 2003; 11th Annual European Giuseppe Battista,Uri Zwick Conference proceedings 2003 Springer-Verlag Berlin Heidelberg 2003

LANCE

https://doi.org/10.1007/978-3-663-16160-8g that 2.-connected bipartite graphs are .-tight. We give a new algorithm for finding a maximal .-sharp subgraph. We also answer a question of Imai and show that finding a maximum size .-sharp subgraph is NP-hard.

手榴彈

肉體

忍受

Adenocarcinoma

Optimal Dynamic Video-on-Demand Using Adaptive Broadcastingnd propose strategies which are optimal for each of them. In particular, we show that an adaptive form of pyramid broadcasting is optimal for both measures simultaneously, up to constant factors. We also show that the maximum throughput for a fixed network bandwidth cannot be obtained by any online strategy.

chronology

正常

Entscheidung über den Einspruchraction of the input data is essentially unnecessary. While grounding the discussion on a few specific examples, I will review some of the basic principles at play behind this “sublinearity” phenomenon.

Antioxidant

GUISE

搖曳的微光

An Optimal Algorithm for the Maximum-Density Segment Problemhe input sequence in an online manner, which is an important feature for dealing with genome-scale sequences. Moreover, for an input sequence . representable in .(.) space, we also show how to exploit the sparsity of . and solve the maximum-density segment problem for . in .(.) time.