Pages that link to "Item:Q1582978"
From MaRDI portal
The following pages link to Approximation algorithms for combinatorial optimization. 3rd international workshop, APPROX 2000, Saarbrücken, Germany, September 5--8, 2000. Proceedings (Q1582978):
Displayed 3 items.
- A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem (Q932651) (← links)
- A note on line broadcast in digraphs under the edge-disjoint paths mode (Q1765240) (← links)
- An Improved Approximation Algorithm for the Matching Augmentation Problem (Q5883280) (← links)