×

Found 30 Documents (Results 1–30)

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
Full Text: DOI arXiv

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).
PDFBibTeX XMLCite
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: Link

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).
PDFBibTeX XMLCite
Full Text: DOI arXiv

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
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI

({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).
PDFBibTeX XMLCite
Full Text: DOI

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
Full Text: DOI

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
Full Text: DOI

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).
PDFBibTeX XMLCite

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).
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field