A Preemptive Algorithm for Maximizing Disjoint Paths on Trees

We consider the on-line version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an on-line fashion, where every request is a path in the tree. The on-line algorithm may accept a request only if it does not share a...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 57; číslo 3; s. 517 - 537
Hlavní autoři:	Azar, Yossi, Feige, Uriel, Glasner, Daniel
Médium:	Journal Article Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	New York Springer-Verlag 01.07.2010 Springer
Témata:	Algorithm Analysis and Problem Complexity Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer Science Computer science; control theory; systems Computer systems and distributed systems. User interface Computer Systems Organization and Communication Networks Data Structures and Information Theory Exact sciences and technology Mathematics of Computing Software Theoretical computing Theory of Computation Online algorithms Admission control Disjoint paths Disjoint paths on trees Call control Access control Preemption Lower bound On line Logarithmic function Competitiveness Routing Approximation algorithm Randomized algorithm Combinatorial optimization Randomization Network protocol Capacity constraint Deterministic algorithms
ISSN:	0178-4617, 1432-0541
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!