OpenAlex | On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree

On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree

Work

Year: 2016

Type: article

Source: Mathematical Programming

Authors Andreas Emil Feldmann, Jochen Könemann, Neil Olver, Laura Sanità

Institutions Hungarian Academy of Sciences, University of Waterloo, Vrije Universiteit Amsterdam

Cites: 34

Cited by: 14

Related to: 10

FWCI: 1.357

Citation percentile (by year/subfield): 83.14

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

Funder Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada