A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands

Given an edge-weighted directed graph G = ( V , E ) on n vertices and a set T = { t 1 , t 2 , … , t p } of p terminals, the objective of the Strongly Connected Steiner Subgraph ( p -SCSS) problem is to find an edge set H ⊆ E of minimum weight such that G [ H ] contains an t i → t j path for each 1 ≤...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 77; číslo 4; s. 1216 - 1239
Hlavní autoři:	Chitnis, Rajesh, Esfandiari, Hossein, Hajiaghayi, MohammadTaghi, Khandekar, Rohit, Kortsarz, Guy, Seddighin, Saeed
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.04.2017 Springer Nature B.V
Témata:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Graph theory Graphs Integers Matching Mathematics of Computing Minimum weight Terminals Theory of Computation Tiling Weighting functions Exponential time hypothesis Directed graphs FPT algorithms Strongly connected Steiner subgraph
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!