The Set Connector Problem in Graphs

From MaRDI portal

Revision as of 02:45, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5429288

Jump to:navigation, search

DOI10.1007/978-3-540-72792-7_36zbMath1136.90490OpenAlexW1585151538MaRDI QIDQ5429288

Hiroshi Nagamochi, Takuro Fukunaga

Publication date: 29 November 2007

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72792-7_36

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Graph orientations with set connectivity requirements

This page was built for publication: The Set Connector Problem in Graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5429288&oldid=20182673"