Pages that link to "Item:Q976065"
From MaRDI portal
The following pages link to Approximating optimum branchings in linear time (Q976065):
Displaying 7 items.
- Branching of solutions of linear time-optimal problem at an irregular point (Q760904) (← links)
- Approximate maximum weight branchings (Q845674) (← links)
- Optimal procedures and complexity analyses of nonserial converging branch networks (Q918445) (← links)
- Effective branching splitting method under cost constraint (Q952828) (← links)
- Super-polynomial approximation branching algorithms (Q2954364) (← links)
- Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems (Q2971609) (← links)
- Constructive linear time algorithms for branchwidth (Q4571992) (← links)