×

Found 11 Documents (Results 1–11)

\((1 + \varepsilon)\)-approximate incremental matching in constant deterministic amortized time. (English) Zbl 1432.68354

Chan, Timothy M. (ed.), Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, SODA 2019, San Diego, CA, USA, January 6–9, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1886-1898 (2019).
PDFBibTeX XMLCite
Full Text: DOI

Budget feasible mechanisms on matroids. (English) Zbl 1422.91312

Eisenbrand, Friedrich (ed.) et al., Integer programming and combinatorial optimization. 19th international conference, IPCO 2017, Waterloo, ON, Canada, June 26–28, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10328, 368-379 (2017).
MSC:  91B26 52B40 90C27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Revenue maximizing envy-free fixed-price auctions with budgets. (English) Zbl 1406.91166

Liu, Tie-Yan (ed.) et al., Web and internet economics. 10th international conference, WINE 2014, Beijing, China, December 14–17, 2014. Proceedings. Cham: Springer (ISBN 978-3-319-13128-3/pbk). Lecture Notes in Computer Science 8877, 233-246 (2014).
MSC:  91B26 91-04
PDFBibTeX XMLCite
Full Text: DOI Link

A path-decomposition theorem with applications to pricing and covering on trees. (English) Zbl 1365.68350

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, 349-360 (2012).
MSC:  68R10 05C85 68W25
PDFBibTeX XMLCite
Full Text: DOI

Approximation algorithms for union and intersection covering problems. (English) Zbl 1246.68262

Chakraborthy, Supraik (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2011), Mumbai, India, December 12–14, 2011. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-34-7). LIPIcs – Leibniz International Proceedings in Informatics 13, 28-40, electronic only (2011).
MSC:  68W25 90C27 90C35
PDFBibTeX XMLCite
Full Text: DOI

Online network design with outliers. (English) Zbl 1287.68012

Abramsky, Samson (ed.) et al., Automata, languages and programming. 37th international colloquium, ICALP 2010, Bordeaux, France, July 6–10, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-14164-5/pbk). Lecture Notes in Computer Science 6198, 114-126 (2010).
PDFBibTeX XMLCite
Full Text: DOI

Stochastic analyses for online combinatorial optimization problems. (English) Zbl 1192.90169

Proceedings of the nineteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, January 20–22, 2008. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-898716-47-4). 942-951 (2008).
MSC:  90C27 68W20
PDFBibTeX XMLCite

Network formation games with local coalitions. (English) Zbl 1283.68057

Proceedings of the 26th annual ACM symposium on principles of distributed computing, PODC ’07, Portland, OR, USA, August 12–15, 2007. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-59593-616-5). 299-305 (2007).
MSC:  68M10 91A43 91A10
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field