• English
    • Norsk
  • English 
    • English
    • Norsk
  • Administration
View Item 
  •   Home
  • Det matematisk-naturvitenskapelige fakultet
  • Institutt for informatikk
  • Institutt for informatikk
  • View Item
  •   Home
  • Det matematisk-naturvitenskapelige fakultet
  • Institutt for informatikk
  • Institutt for informatikk
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

The 2-hop spanning tree problem

Dahl, Geir
Research report
View/Open
GDahl-3.pdf (268.0Kb)
Year
1997
Permanent link
http://urn.nb.no/URN:NBN:no-13704

Is part of
Research report
Metadata
Show metadata
Appears in the following Collection
  • Institutt for informatikk [3652]
Abstract
Given a graph G with a specified root node r. A spanning tree in G where each node has distance at most 2 from r is called a 2-hop spanning tree. For given edge weights the 2-hop spanning tree problem is to find a minimum weight 2-hop spanning tree. The problem is NP-hard and has some interesting applications. We study a polytope associated with a directed model of the problem give a completeness result for wheels and a vertex description of a linear relaxation. Some classes of valid inequalities for the convex hull of incidence vectors of 2-hop spanning trees are derived by projection techniques.
 
Responsible for this website 
University of Oslo Library


Contact Us 
duo-hjelp@ub.uio.no


Privacy policy
 

 

For students / employeesSubmit master thesisAccess to restricted material

Browse

All of DUOCommunities & CollectionsBy Issue DateAuthorsTitlesThis CollectionBy Issue DateAuthorsTitles

For library staff

Login
RSS Feeds
 
Responsible for this website 
University of Oslo Library


Contact Us 
duo-hjelp@ub.uio.no


Privacy policy