Pages that link to "Item:Q3395040"

The following pages link to Combination Can Be Hard: Approximability of the Unique Coverage Problem (Q3395040):

Displaying 24 items.

• Approximating the revenue maximization problem with sharp demands (Q501665) (← links)
• On nonlinear multi-covering problems (Q511715) (← links)
• The Stackelberg minimum spanning tree game (Q627533) (← links)
• On the complexity of a bundle pricing problem (Q657580) (← links)
• The checkpoint problem (Q714790) (← links)
• Minimum ply covering of points with disks and squares (Q827338) (← links)
• A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares (Q902421) (← links)
• Optimal deterministic broadcasting in known topology radio networks (Q1954200) (← links)
• On fair price discrimination in multi-unit markets (Q2046039) (← links)
• Exact multi-covering problems with geometric sets (Q2075389) (← links)
• A 4.31-approximation for the geometric unique coverage problem on unit disks (Q2250456) (← links)
• On social envy-freeness in multi-unit markets (Q2321269) (← links)
• Geometric red-blue set cover for unit squares and related problems (Q2341691) (← links)
• The parameterized complexity of unique coverage and its variants (Q2392923) (← links)
• Stackelberg network pricing games (Q2429327) (← links)
• Stackelberg network pricing is hard to approximate (Q3082599) (← links)
• Unique Covering Problems with Geometric Sets (Q3196414) (← links)
• Unique Coverage with Rectangular Regions (Q4631010) (← links)
• On stackelberg pricing with computationally bounded customers (Q4648689) (← links)
• (Q5005149) (← links)
• Nearly Optimal NP-Hardness of Unique Coverage (Q5269824) (← links)
• Local search strikes again: PTAS for variants of geometric covering and packing (Q5919362) (← links)
• Reception capacity: definitions, game theory and hardness (Q6536157) (← links)
• Approximation algorithms for minimum ply covering of points with unit squares and unit disks (Q6652449) (← links)