Fast Polynomial-Space Algorithms Using Inclusion-Exclusion: Improving on Steiner Tree and Related Problems

ISSN： 0178-4617

Source： Algorithmica, Vol.65, Iss.4, 2013-04, pp. : 868-884

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Infiniteness of proof( ) is polynomial-space complete

By Hirokawa S.

Theoretical Computer Science, Vol. 206, Iss. 1, 1998-10 ,pp. : 331-339

Elsevier

Access to resources Recommend Favorite

On approximation algorithms for the terminal Steiner tree problem

By Drake D.E. Hougardy S.

Information Processing Letters, Vol. 89, Iss. 1, 2004-01 ,pp. : 15-18

Elsevier

Access to resources Recommend Favorite

A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem

By Bezenšek Mitja Robič Borut

International Journal of Parallel Programming, Vol. 42, Iss. 2, 2014-04 ,pp. : 287-319

Springer Publishing Company

Access to resources Recommend Favorite

Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks

By Min Manki Du Hongwei Jia Xiaohua Huang Christina Huang Scott Wu Weili

Journal of Global Optimization, Vol. 35, Iss. 1, 2006-05 ,pp. : 111-119

Springer Publishing Company

Access to resources Recommend Favorite

A Polynomial Time Approximation Scheme for Minimum Cost Delay-Constrained Multicast Tree under a Steiner Topology

By Xue Guoliang Xiao Wei

Algorithmica, Vol. 41, Iss. 1, 2004-10 ,pp. : 53-72

Springer Publishing Company

Access to resources Recommend Favorite