SANKOWSKI, PIOTR
SANKOWSKI, PIOTR
Mostra
prodotti
Risultati 1 - 7 di 7 (tempo di esecuzione: 0.009 secondi).
(1 + ε)-approximate incremental matching in constant deterministic amortized time
2019 Grandoni, F.; Leonardi, S.; Sankowski, P.; Schwiegelshohn, C.; Solomon, S.
Budget feasible mechanisms on matroids
2017 Leonardi, Stefano; Monaco, Gianpiero; Sankowski, Piotr; Zhang, Qiang
Network formation games with local coalitions
2007 Leonardi, Stefano; Sankowski, Piotr
Revenue maximizing envy-free multi-unit auctions with budgets
2012 Michal, Feldman; Amos, Fiat; Leonardi, Stefano; Sankowski, Piotr
SET COVERING WITH OUR EYES CLOSED
2013 Fabrizio, Grandoni; Anupam, Gupta; Leonardi, Stefano; Pauli, Miettinen; Sankowski, Piotr; Mohit, Singh
Set Covering with Our Eyes Closed.
2008 Grandoni, Fabrizio; Anupam, Gupta; Leonardi, Stefano; Pauli, Miettinen; Sankowski, Piotr; Mohit, Singh
Stochastic analyses for online combinatorial optimization problems.
2008 Garg, N; Gupta, A; Leonardi, Stefano; Sankowski, Piotr
Titolo | Data di pubblicazione | Autore(i) | File |
---|---|---|---|
(1 + ε)-approximate incremental matching in constant deterministic amortized time | 2019 | Grandoni, F.; Leonardi, S.; Sankowski, P.; Schwiegelshohn, C.; Solomon, S. | |
Budget feasible mechanisms on matroids | 2017 | Leonardi, Stefano; Monaco, Gianpiero; Sankowski, Piotr; Zhang, Qiang | |
Network formation games with local coalitions | 2007 | Leonardi, Stefano; Sankowski, Piotr | |
Revenue maximizing envy-free multi-unit auctions with budgets | 2012 | Michal, Feldman; Amos, Fiat; Leonardi, Stefano; Sankowski, Piotr | |
SET COVERING WITH OUR EYES CLOSED | 2013 | Fabrizio, Grandoni; Anupam, Gupta; Leonardi, Stefano; Pauli, Miettinen; Sankowski, Piotr; Mohit, Singh | |
Set Covering with Our Eyes Closed. | 2008 | Grandoni, Fabrizio; Anupam, Gupta; Leonardi, Stefano; Pauli, Miettinen; Sankowski, Piotr; Mohit, Singh | |
Stochastic analyses for online combinatorial optimization problems. | 2008 | Garg, N; Gupta, A; Leonardi, Stefano; Sankowski, Piotr |