Pages that link to "Item:Q3532565"

The following pages link to A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game (Q3532565):

Displaying 21 items.

• Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
• Optimal cost sharing for capacitated facility location games (Q297094) (← links)
• A partition-based relaxation for Steiner trees (Q535014) (← links)
• When ignorance helps: graphical multicast cost sharing games (Q844895) (← links)
• The sequential equal surplus division for rooted forest games and an application to sharing a river with bifurcations (Q892979) (← links)
• Black-box reductions for cost-sharing mechanism design (Q1735730) (← links)
• Strategic cooperation in cost sharing games (Q1939521) (← links)
• Stronger MIP formulations for the Steiner forest problem (Q2227541) (← links)
• Approximation of Steiner forest via the bidirected cut relaxation (Q2279758) (← links)
• A group-strategyproof mechanism for Steiner forests (Q2921719) (← links)
• Efficient Black-Box Reductions for Separable Cost Sharing (Q4991670) (← links)
• A Local-Search Algorithm for Steiner Forest (Q4993295) (← links)
• (Q5002844) (← links)
• An Exact Algorithm for the Steiner Forest Problem (Q5009640) (← links)
• Distance Transformation for Network Design Problems (Q5231681) (← links)
• A Characterization of Undirected Graphs Admitting Optimal Cost Shares (Q5238743) (← links)
• Structural Information and Communication Complexity (Q5710086) (← links)
• Automata, Languages and Programming (Q5716840) (← links)
• (Q5743446) (← links)
• Approximation algorithms for Steiner forest: An experimental study (Q6065858) (← links)
• Algorithmic solutions for maximizing shareable costs (Q6659082) (← links)