A 43-approximation for the maximum leaf spanning arborescence problem in DAGs.
Saved in:
| Title: | A 43-approximation for the maximum leaf spanning arborescence problem in DAGs. |
|---|---|
| Authors: | Neuwohner, Meike1 (AUTHOR) work@meike-neuwohner.de |
| Source: | Mathematical Programming. Mar2026, Vol. 216 Issue 1/2, p111-133. 23p. |
| Database: | Business Source Ultimate |
|
Full text is not displayed to guests.
Login for full access.
|
|
| FullText | Links: – Type: pdflink Text: Availability: 1 |
|---|---|
| Header | DbId: bsu DbLabel: Business Source Ultimate An: 193308443 AccessLevel: 2 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: A 43-approximation for the maximum leaf spanning arborescence problem in DAGs. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Neuwohner%2C+Meike%22">Neuwohner, Meike</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> work@meike-neuwohner.de</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Mathematical+Programming%22">Mathematical Programming</searchLink>. Mar2026, Vol. 216 Issue 1/2, p111-133. 23p. |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=bsu&AN=193308443 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s10107-025-02233-0 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 23 StartPage: 111 Titles: – TitleFull: A 43-approximation for the maximum leaf spanning arborescence problem in DAGs. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Neuwohner, Meike IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 03 Text: Mar2026 Type: published Y: 2026 Identifiers: – Type: issn-print Value: 00255610 Numbering: – Type: volume Value: 216 – Type: issue Value: 1/2 Titles: – TitleFull: Mathematical Programming Type: main |
| ResultId | 1 |