Pages that link to "Item:Q1977131"
From MaRDI portal
The following pages link to One for the price of two: a unified approach for approximating covering problems (Q1977131):
Displaying 21 items.
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
- Bounding the payment of approximate truthful mechanisms (Q476890) (← links)
- Local ratio with negative weights. (Q703278) (← links)
- Using fractional primal-dual to schedule split intervals with demands (Q865744) (← links)
- Exploiting locality: Approximating sorting buffers (Q925070) (← links)
- Improved approximation algorithm for convex recoloring of trees (Q927405) (← links)
- Approximating the 2-interval pattern problem (Q932323) (← links)
- The minimum substring cover problem (Q958306) (← links)
- Elementary approximation algorithms for prize collecting Steiner tree problems (Q963393) (← links)
- A note on Rooted Survivable Networks (Q990935) (← links)
- Resource allocation in bounded degree trees (Q1024215) (← links)
- A new approach for approximating node deletion problems (Q1029021) (← links)
- Flexible bandwidth assignment with application to optical networks (Q1617285) (← links)
- Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749) (← links)
- Approximating activation edge-cover and facility location problems (Q2166781) (← links)
- Admission control with advance reservations in simple networks (Q2466012) (← links)
- Efficient approximation of convex recolorings (Q2643731) (← links)
- (Q5092379) (← links)
- The Minimum Substring Cover Problem (Q5443381) (← links)
- Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems (Q5505663) (← links)