Back to Results
First PageMeta Content
Network theory / Shortest path problem / Binary tree / Tree / Steiner tree problem / Connectivity / Minimum spanning tree / Quasi-bipartite graph / Graph theory / Theoretical computer science / Mathematics


CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 A Note on Online Steiner Tree Problems Gokarna Sharma∗ Abstract
Add to Reading List

Document Date: 2014-06-20 14:13:50

Open Document

File Size: 454,77 KB

Share Result on Facebook

City

Thus / P. Plassmann / Bern / Halifax / New York / /

Company

B. / W. H. Freeman & Co. / /

/

Facility

Louisiana State University / /

IndustryTerm

online situations / online steiner tree problem / online and classical versions / on-line multicast routing problem / online problem / actual communication networks / approximation algorithm / feasible solution / classical and online versions / greedy algorithm / Online Steiner Tree Problems Gokarna Sharma∗ Abstract We / deterministic algorithm / deterministic approximation algorithm / improved approximation algorithm / online versions / approximation algorithms / /

Organization

Louisiana State University / School of Electrical Engineering and Computer Science / /

Person

Costas Busch / /

ProvinceOrState

Nova Scotia / New York / /

PublishedMedium

Theoretical Computer Science / /

RadioStation

Nova / /

Technology

aforementioned algorithm / 2014 Algorithm / BTSTP algorithm / deterministic approximation algorithm / approximation algorithm / deterministic algorithm / approximation algorithms / ESA / improved approximation algorithm / BSTP approximation algorithm / SNP / /

SocialTag