Back to Results
First PageMeta Content
NP-complete problems / Spanning tree / Steiner tree problem / NP-hard problems / Minimum spanning tree / Tree / Vertex cover / Rectilinear Steiner tree / Connectivity / Graph theory / Theoretical computer science / Mathematics


CCCG 2011, Toronto ON, August 10–12, 2011 Bottleneck Steiner Tree with Bounded Number of Steiner Vertices A. Karim Abu-Affash∗ Paz Carmi†
Add to Reading List

Document Date: 2011-08-15 18:22:15

Open Document

File Size: 253,72 KB

Share Result on Facebook

City

Amsterdam / Dordrecht / /

Company

SIAM Journal / Computer Sciences / /

Country

Netherlands / Israel / Sudan / /

/

Facility

Ben-Gurion University / /

IndustryTerm

polynomial-time approximation algorithm / polynomial-time approximation algorithms / transportation / approximation algorithm / polynomialtime approximation algorithm / important applications / approximation algorithms / /

NaturalFeature

Negev / /

Organization

Israel Ministry of Industry / Trade and Labor / Robert H. Arnow Center for Bedouin Studies and Development / Israel Council for Higher Education / Israel Ministry of Science and Technology / Ben-Gurion University of the Negev / Israel Science Foundation / Department of Computer Science / German-Israeli Foundation / Lynn / William Frankel Center for Computer Sciences / Planning & Budgeting Committee / /

Person

A. Karim Abu-Affash / Matthew J. Katz / /

PublishedMedium

SIAM Journal on Computing / Journal of the ACM / IEEE Transactions on Computers / /

Technology

polynomial-time approximation algorithm / polynomial-time 2-approximation algorithm / polynomial-time approximation algorithms / polynomialtime approximation algorithm / approximation algorithm / 1.598 approximation algorithm / 2-approximation algorithm / time algorithm / approximation algorithms / 3 2-Approximation Algorithm / /

SocialTag