scientific article
From MaRDI portal
Publication:2934710
zbMath1302.90235MaRDI QIDQ2934710
Anupam Gupta, Jochen Könemann, R. Ravi, Stefano Leonardi, Guido Schäfer
Publication date: 18 December 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (11)
Beyond Moulin mechanisms ⋮ When ignorance helps: graphical multicast cost sharing games ⋮ Cost sharing in two-sided markets ⋮ Cost-sharing mechanisms for scheduling under general demand settings ⋮ Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems ⋮ Black-box reductions for cost-sharing mechanism design ⋮ Approximating \(k\)-generalized connectivity via collapsing HSTs ⋮ Elementary approximation algorithms for prize collecting Steiner tree problems ⋮ Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems ⋮ Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems ⋮ Unnamed Item
This page was built for publication:
