Ahunbay, Mete Şeref; Vetta, Adrian The price of anarchy of two-buyer sequential multiunit auctions. (English) Zbl 07666402 Chen, Xujin (ed.) et al., Web and internet economics. 16th international conference, WINE 2020, Beijing, China, December 7–11, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12495, 147-161 (2020). MSC: 68M11 91A80 91B26 PDFBibTeX XMLCite \textit{M. Ş. Ahunbay} and \textit{A. Vetta}, Lect. Notes Comput. Sci. 12495, 147--161 (2020; Zbl 07666402) Full Text: DOI arXiv
Hunkenschröder, Christoph; Vempala, Santosh; Vetta, Adrian A 4/3-approximation algorithm for the minimum 2-edge connected subgraph problem. (English) Zbl 1454.68184 ACM Trans. Algorithms 15, No. 4, Article No. 55, 28 p. (2019). MSC: 68W25 05C40 05C85 68R10 PDFBibTeX XMLCite \textit{C. Hunkenschröder} et al., ACM Trans. Algorithms 15, No. 4, Article No. 55, 28 p. (2019; Zbl 1454.68184) Full Text: DOI
Shepherd, F. Bruce; Vetta, Adrian R. The inapproximability of maximum single-sink unsplittable, priority and confluent flow problems. (English) Zbl 1387.68127 Theory Comput. 13, Paper No. 20, 25 p. (2017). MSC: 68Q17 68Q25 68W25 90B10 PDFBibTeX XMLCite \textit{F. B. Shepherd} and \textit{A. R. Vetta}, Theory Comput. 13, Paper No. 20, 25 p. (2017; Zbl 1387.68127) Full Text: DOI arXiv
Cai, Yang (ed.); Vetta, Adrian (ed.) Web and internet economics. 12th international conference, WINE 2016, Montreal, Canada, December 11–14, 2016. Proceedings. (English) Zbl 1352.68009 Lecture Notes in Computer Science 10123. Berlin: Springer (ISBN 978-3-662-54109-8/pbk; 978-3-662-54110-4/ebook). xi, 482 p. (2016). MSC: 68-06 91-06 68M11 91A80 91B26 00B25 PDFBibTeX XMLCite \textit{Y. Cai} (ed.) and \textit{A. Vetta} (ed.), Web and internet economics. 12th international conference, WINE 2016, Montreal, Canada, December 11--14, 2016. Proceedings. Berlin: Springer (2016; Zbl 1352.68009) Full Text: DOI
Joret, Gwenaël; Vetta, Adrian Reducing the rank of a matroid. (English) Zbl 1327.05054 Discrete Math. Theor. Comput. Sci. 17, No. 2, 143-156 (2015). MSC: 05B35 68Q17 PDFBibTeX XMLCite \textit{G. Joret} and \textit{A. Vetta}, Discrete Math. Theor. Comput. Sci. 17, No. 2, 143--156 (2015; Zbl 1327.05054) Full Text: arXiv Link
Cheriyan, Joseph; Laekhanukit, Bundit; Naves, Guyslain; Vetta, Adrian Approximating rooted Steiner networks. (English) Zbl 1398.68664 ACM Trans. Algorithms 11, No. 2, Article No. 8, 22 p. (2014). MSC: 68W25 05C40 68Q17 68R10 PDFBibTeX XMLCite \textit{J. Cheriyan} et al., ACM Trans. Algorithms 11, No. 2, Article No. 8, 22 p. (2014; Zbl 1398.68664) Full Text: DOI
Laekhanukit, Bundit; Vetta, Adrian; Wilfong, Gordon Routing regardless of network stability. (English) Zbl 1314.68029 Algorithmica 70, No. 3, 561-593 (2014). MSC: 68M10 68M12 68Q17 PDFBibTeX XMLCite \textit{B. Laekhanukit} et al., Algorithmica 70, No. 3, 561--593 (2014; Zbl 1314.68029) Full Text: DOI arXiv
Blanchette, Mathieu; Kim, Ethan; Vetta, Adrian Clique cover on sparse networks. (English) Zbl 1429.68178 Bader, David A. (ed.) et al., Proceedings of the 14th workshop on algorithm engineering and experiments (ALENEX ’12), Kyoto, Japan, January 16, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 93-102 (2012). MSC: 68R10 05C69 05C70 05C85 68W40 92C42 PDFBibTeX XMLCite \textit{M. Blanchette} et al., in: Proceedings of the 14th workshop on algorithm engineering and experiments (ALENEX '12), Kyoto, Japan, January 16, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 93--102 (2012; Zbl 1429.68178) Full Text: DOI
Cheriyan, Joseph; Laekhanukit, Bundit; Naves, Guyslain; Vetta, Adrian Approximating rooted Steiner networks. (English) Zbl 1421.68202 Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1499-1511 (2012). MSC: 68W25 05C40 68Q17 68R10 PDFBibTeX XMLCite \textit{J. Cheriyan} et al., in: Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17--19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1499--1511 (2012; Zbl 1421.68202) Full Text: Link
Laekhanukit, Bundit; Vetta, Adrian; Wilfong, Gordon Routing regardless of network stability. (English) Zbl 1365.68053 Epstein, Leah (ed.) et al., Algorithms – ESA 2012. 20th annual European symposium, Ljubljana, Slovenia, September 10–12, 2012. Proceeding. Berlin: Springer (ISBN 978-3-642-33089-6/pbk). Lecture Notes in Computer Science 7501, 719-730 (2012). MSC: 68M10 68M12 68Q17 68R10 68W20 PDFBibTeX XMLCite \textit{B. Laekhanukit} et al., Lect. Notes Comput. Sci. 7501, 719--730 (2012; Zbl 1365.68053) Full Text: DOI arXiv
Drescher, Matthew; Vetta, Adrian An approximation algorithm for the maximum leaf spanning arborescence problem. (English) Zbl 1300.68065 ACM Trans. Algorithms 6, No. 3, Article No. 46, 18 p. (2010). MSC: 68W25 68Q17 05C05 PDFBibTeX XMLCite \textit{M. Drescher} and \textit{A. Vetta}, ACM Trans. Algorithms 6, No. 3, Article No. 46, 18 p. (2010; Zbl 1300.68065) Full Text: DOI Link
Naves, Guyslain; Sonnerat, Nicolas; Vetta, Adrian Maximum flows on disjoint paths. (English) Zbl 1306.90022 Serna, Maria (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 13th international workshop, APPROX 2010, and 14th international workshop, RANDOM 2010, Barcelona, Spain, September 1–3, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15368-6/pbk). Lecture Notes in Computer Science 6302, 326-337 (2010). MSC: 90B10 05C21 68Q17 PDFBibTeX XMLCite \textit{G. Naves} et al., Lect. Notes Comput. Sci. 6302, 326--337 (2010; Zbl 1306.90022) Full Text: DOI
Li, Zhentao; Vetta, Adrian Bounds on the cleaning times of robot vacuums. (English) Zbl 1229.68056 Oper. Res. Lett. 38, No. 1, 69-71 (2010). MSC: 68R10 05C35 05C82 68T40 90C27 PDFBibTeX XMLCite \textit{Z. Li} and \textit{A. Vetta}, Oper. Res. Lett. 38, No. 1, 69--71 (2010; Zbl 1229.68056) Full Text: DOI
Sonnerat, Nicolas; Vetta, Adrian Defending planar graphs against star-cutsets. (English) Zbl 1273.68412 Nešetřil, Jaroslav (ed.) et al., Extended abstracts of the 5th European conference on combinatorics, graph theory and applications, EuroComb’09, Bordeaux, France, September 7–11, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 34, 107-111 (2009). MSC: 68W25 05C10 05C40 05C85 PDFBibTeX XMLCite \textit{N. Sonnerat} and \textit{A. Vetta}, Electron. Notes Discrete Math. 34, 107--111 (2009; Zbl 1273.68412) Full Text: DOI
Farzad, Babak; Olver, Neil; Vetta, Adrian A priority-based model of routing. (English) Zbl 1286.68227 Chic. J. Theor. Comput. Sci. 2008, Article No. 1, 29 p. (2008). MSC: 68Q25 68M10 90B18 PDFBibTeX XMLCite \textit{B. Farzad} et al., Chic. J. Theor. Comput. Sci. 2008, Article No. 1, 29 p. (2008; Zbl 1286.68227) Full Text: DOI
Addario-Berry, Louigi; Olver, Neil; Vetta, Adrian A polynomial time algorithm for finding Nash equilibria in planar win-lose games. (English) Zbl 1152.91382 J. Graph Algorithms Appl. 11, No. 1, 309-319 (2007). MSC: 91A43 05C90 91A05 68Q25 PDFBibTeX XMLCite \textit{L. Addario-Berry} et al., J. Graph Algorithms Appl. 11, No. 1, 309--319 (2007; Zbl 1152.91382) Full Text: DOI EMIS
Donovan, P.; Shepherd, B.; Vetta, A.; Wilfong, G. Deqree-constrained network flows. (English) Zbl 1232.68015 STOC’07. Proceedings of the 39th annual ACM symposium on theory of computing, San Diego, CA, USA, June 11–13, 2007. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-59593-631-8). 681-688 (2007). MSC: 68M07 68W25 68R10 68Q17 PDFBibTeX XMLCite \textit{P. Donovan} et al., in: Proceedings of the 39th annual ACM symposium on theory of computing, STOC 2007. San Diego, CA, USA, June 11--13, 2007. New York, NY: Association for Computing Machinery (ACM). 681--688 (2007; Zbl 1232.68015) Full Text: DOI
Chen, Jiangzhuo; Kleinberg, Robert D.; Lovász, László; Rajaraman, Rajmohan; Sundaram, Ravi; Vetta, Adrian (Almost) tight bounds and existence theorems for single-commodity confluent flows. (English) Zbl 1311.90017 J. ACM 54, No. 4, Article No. 16, 32 p. (2007). MSC: 90B10 90C35 68Q25 68W25 68W40 PDFBibTeX XMLCite \textit{J. Chen} et al., J. ACM 54, No. 4, Article No. 16, 32 p. (2007; Zbl 1311.90017) Full Text: DOI
Cheriyan, Joseph; Vetta, Adrian Approximation algorithms for network design with metric costs. (English) Zbl 1154.68110 SIAM J. Discrete Math. 21, No. 3, 612-636 (2007). MSC: 68W25 05C40 05C85 68R10 90C27 PDFBibTeX XMLCite \textit{J. Cheriyan} and \textit{A. Vetta}, SIAM J. Discrete Math. 21, No. 3, 612--636 (2007; Zbl 1154.68110) Full Text: DOI
Shepherd, F. B.; Vetta, A. The demand-matching problem. (English) Zbl 1341.90117 Math. Oper. Res. 32, No. 3, 563-578 (2007). MSC: 90C27 05C70 05C85 68W25 90C05 90C59 91B68 PDFBibTeX XMLCite \textit{F. B. Shepherd} and \textit{A. Vetta}, Math. Oper. Res. 32, No. 3, 563--578 (2007; Zbl 1341.90117) Full Text: DOI
Fiorini, Samuel; Hardy, Nadia; Reed, Bruce; Vetta, Adrian Approximate min-max relations for odd cycles in planar graphs. (English) Zbl 1113.05054 Math. Program. 110, No. 1 (B), 71-91 (2007). MSC: 05C38 05C85 68W25 90C27 PDFBibTeX XMLCite \textit{S. Fiorini} et al., Math. Program. 110, No. 1 (B), 71--91 (2007; Zbl 1113.05054) Full Text: DOI
Cheriyan, Joseph; Vempala, Santosh; Vetta, Adrian Network design via iterative rounding of setpair relaxations. (English) Zbl 1109.68136 Combinatorica 26, No. 3, 255-275 (2006). Reviewer: Roberto Solis-Oba (London, ON) MSC: 68W25 90C35 05C40 PDFBibTeX XMLCite \textit{J. Cheriyan} et al., Combinatorica 26, No. 3, 255--275 (2006; Zbl 1109.68136) Full Text: DOI
Cheriyan, Joseph; Vetta, Adrian Approximation algorithms for network design with metric costs. (English) Zbl 1192.68884 STOC’05: Proceedings of the 37th annual ACM symposium on theory of computing, Baltimore, MD, USA, May 22–24, 2005. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-960-8). 167-175 (2005). MSC: 68W25 05C85 68R10 90C35 PDFBibTeX XMLCite \textit{J. Cheriyan} and \textit{A. Vetta}, in: Proceedings of the 37th annual ACM symposium on theory of computing, STOC'05. Baltimore, MD, USA, May 22--24, 2005. New York, NY: Association for Computing Machinery (ACM). 167--175 (2005; Zbl 1192.68884) Full Text: DOI
Kannan, Ravi; Vempala, Santosh; Vetta, Adrian On clusterings: good, bad and spectral. (English) Zbl 1192.05160 J. ACM 51, No. 3, 497-515 (2004). MSC: 05C85 05C50 68W40 PDFBibTeX XMLCite \textit{R. Kannan} et al., J. ACM 51, No. 3, 497--515 (2004; Zbl 1192.05160) Full Text: DOI
Chen, Jiangzhuo; Kleinberg, Robert D.; Lovász, László; Rajaraman, Rajmohan; Sundaram, Ravi; Vetta, Adrian ({A}lmost) tight bounds and existence theorems for confluent flows. (English) Zbl 1192.90022 Proceedings of the 36th annual ACM symposium on theory of computing (STOC 2004), Chicago, IL, USA, June 13 - 15, 2004. New York, NY: ACM Press (ISBN 1-58113-852-0). 529-538, electronic only (2004). MSC: 90B10 05C85 68M10 68R10 PDFBibTeX XMLCite \textit{J. Chen} et al., in: Proceedings of the 36th annual ACM symposium on theory of computing, STOC 2004. Chicago, IL, USA, June 13--15, 2004. New York, NY: ACM Press. 529--538 (2004; Zbl 1192.90022) Full Text: DOI
Mirrokni, Vahab S.; Vetta, Adrian Convergence issues in competitive games. (English) Zbl 1105.91300 Jansen, Klaus (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 7th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2004 and 8th international workshop on randomization and computation, RANDOM 2004, Cambridge, MA, USA, August22-24, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22894-2/pbk). Lecture Notes in Computer Science 3122, 183-194 (2004). MSC: 91A10 91B16 68W25 PDFBibTeX XMLCite \textit{V. S. Mirrokni} and \textit{A. Vetta}, Lect. Notes Comput. Sci. 3122, 183--194 (2004; Zbl 1105.91300) Full Text: DOI
Cheriyan, Joseph; Vempala, Santosh; Vetta, Adrian An approximation algorithm for the minimum-cost \(k\)-vertex connected subgraph. (English) Zbl 1029.68158 SIAM J. Comput. 32, No. 4, 1050-1055 (2003). MSC: 68W25 05C40 68R10 90C27 PDFBibTeX XMLCite \textit{J. Cheriyan} et al., SIAM J. Comput. 32, No. 4, 1050--1055 (2003; Zbl 1029.68158) Full Text: DOI
Cheriyan, Joseph; Vempala, Santosh; Vetta, Adrian Approximation algorithms for minimum-cost \(k\)-vertex connected subgraphs. (English) Zbl 1192.68883 Proceedings of the thirty-fourth annual ACM symposium on theory of computing (STOC 2002), Montreal, Quebec, Canada, May 19–21, 2002. New York, NY: ACM Press (ISBN 1-581-13495-9). 306-312, electronic only (2002). MSC: 68W25 05C85 PDFBibTeX XMLCite \textit{J. Cheriyan} et al., in: Proceedings of the thirty-fourth annual ACM symposium on theory of computing, STOC 2002. Montreal, Quebec, Canada, May 19--21, 2002. New York, NY: ACM Press. 306--312 (2002; Zbl 1192.68883) Full Text: DOI
Vetta, Adrian Approximating the minimum strongly connected subgraph via a matching lower bound. (English) Zbl 0987.05090 Kosaraju, Deborah, Proceedings of the 12th annual ACM-SIAM symposium on discrete algorithms. Washington, DC, USA, January 7-9, 2001. Philadelphia, PA: SIAM, Society for Industrial and Applied Mathematics. 417-426 (2001). MSC: 05C85 05C20 68R10 05C70 PDFBibTeX XMLCite \textit{A. Vetta}, in: Proceedings of the 12th annual ACM-SIAM symposium on discrete algorithms, SODA 2001, Washington, DC, USA, January 7--9, 2001. Philadelphia, PA: SIAM, Society for Industrial and Applied Mathematics; New York, NY: ACM, Association for Computing Machinery. 417--426 (2001; Zbl 0987.05090)
Vempala, Santosh; Vetta, Adrian Factor \(\frac{4}{3}\) approximations for minimum 2-connected subgraphs. (English) Zbl 0976.90114 Jansen, Klaus (ed.) et al., Approximation algorithms for combinatorial optimization. 3rd international workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1913, 262-273 (2000). MSC: 90C35 05C85 68W25 90C59 PDFBibTeX XMLCite \textit{S. Vempala} and \textit{A. Vetta}, Lect. Notes Comput. Sci. 1913, 262--273 (2000; Zbl 0976.90114)