×

Found 91 Documents (Results 1–91)

Degree realization by bipartite multigraphs. (English) Zbl 07786512

Rajsbaum, Sergio (ed.) et al., Structural information and communication complexity. 30th international colloquium, SIROCCO 2023, Alcalá de Henares, Spain, June 6–9, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13892, 3-17 (2023).
MSC:  68Mxx 68Q11 68R10
PDFBibTeX XMLCite
Full Text: DOI

Randomized strategies for non-additive 3-slope ski rental. (English) Zbl 07615851

Parter, Merav (ed.), Structural information and communication complexity. 29th international colloquium, SIROCCO 2022, Paderborn, Germany, June 27–29, 2022, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13298, 62-78 (2022).
MSC:  68Mxx 68Q11 68R10
PDFBibTeX XMLCite
Full Text: DOI

Vertex-weighted graphs: realizable and unrealizable domains. (English) Zbl 07556581

Mutzel, Petra (ed.) et al., WALCOM: algorithms and computation. 16th international conference and workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13174, 315-327 (2022).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Selected neighbor degree forest realization. (English) Zbl 07788600

Ahn, Hee-Kap (ed.) et al., 32nd international symposium on algorithms and computation, ISAAC 2021, Fukuoka, Japan, December 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 212, Article 27, 15 p. (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Overflow management with self-eliminations. (English) Zbl 1498.68045

Gąsieniec, Leszek (ed.) et al., Algorithms for sensor systems. 17th international symposium on algorithms and experiments for wireless sensor networks, ALGOSENSORS 2021, Lisbon, Portugal, September 9–10, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12961, 124-139 (2021).
MSC:  68M20 68W20 68W27
PDFBibTeX XMLCite
Full Text: DOI

Weighted microscopic image reconstruction. (English) Zbl 1490.68270

Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 373-386 (2021).
MSC:  68U10 05C50 68R10
PDFBibTeX XMLCite
Full Text: DOI

Graph realizations: maximum degree in vertex neighborhoods. (English) Zbl 07759278

Albers, Susanne (ed.), 17th Scandinavian symposium and workshops on algorithm theory, SWAT 2020, Tórshavn, Faroe Islands, June 22–24, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 162, Article 10, 17 p. (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Minimum neighboring degree realization in graphs and trees. (English) Zbl 07651149

Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 10, 15 p. (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Efficiently realizing interval sequences. (English) Zbl 07650280

Lu, Pinyan (ed.) et al., 30th international symposium on algorithms and computation, ISAAC 2019, Shanghai University of Finance and Economics, Shanghai, China, December 8–11, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 149, Article 47, 15 p. (2019).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

The generalized microscopic image reconstruction problem. (English) Zbl 1527.68252

Lu, Pinyan (ed.) et al., 30th international symposium on algorithms and computation, ISAAC 2019, Shanghai University of Finance and Economics, Shanghai, China, December 8–11, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 149, Article 42, 15 p. (2019).
MSC:  68U10 68R10
PDFBibTeX XMLCite
Full Text: DOI

Brief announcement: Simple and local independent set approximation. (English) Zbl 1428.68392

Proceedings of the 37th ACM symposium on principles of distributed computing, PODC ’18, Egham, UK, July 23–27, 2018. New York, NY: Association for Computing Machinery (ACM). 163-165 (2018).
PDFBibTeX XMLCite
Full Text: DOI

Simple and local independent set approximation. (English) Zbl 1517.68279

Lotker, Zvi (ed.) et al., Structural information and communication complexity. 25th international colloquium, SIROCCO 2018, Ma’ale HaHamisha, Israel, June 18–21, 2018. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 11085, 88-101 (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Realizability of graph specifications: characterizations and algorithms. (English) Zbl 1517.68271

Lotker, Zvi (ed.) et al., Structural information and communication complexity. 25th international colloquium, SIROCCO 2018, Ma’ale HaHamisha, Israel, June 18–21, 2018. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 11085, 3-13 (2018).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI

Maximizing barrier coverage lifetime with static sensors. (English) Zbl 1503.68029

Fernández Anta, Antonio (ed.) et al., Algorithms for sensor systems. 13th international symposium on algorithms and experiments for wireless sensor networks, ALGOSENSORS 2017, Vienna, Austria, September 7–8, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10718, 198-210 (2017).
MSC:  68M18 68W25 68W40
PDFBibTeX XMLCite
Full Text: DOI

Local search algorithms for the maximum carpool matching problem. (English) Zbl 1442.68267

Pruhs, Kirk (ed.) et al., 25th European symposium on algorithms, ESA 2017, Vienna, Austria, September 4–6, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 87, Article 55, 14 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

Online budgeted maximum coverage. (English) Zbl 1397.68234

Sankowski, Piotr (ed.) et al., 24th annual European symposium on algorithms, ESA 2016, Aarhus, Denmark, August 22–24, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-015-6). LIPIcs – Leibniz International Proceedings in Informatics 57, Article 73, 17 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI

Distributed approximation of \(k\)-service assignment. (English) Zbl 1380.68427

Anceaume, Emmanuelle (ed.) et al., 19th international conference on principles of distributed systems, OPODIS 2015, Rennes, France, December 14–17, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-98-9). LIPIcs – Leibniz International Proceedings in Informatics 46, Article 11, 16 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI

1.5-approximation algorithm for the 2-convex recoloring problem. (English) Zbl 1474.68209

Lipták, Zsuzsanna (ed.) et al., Combinatorial algorithms. 26th international workshop, IWOCA 2015, Verona, Italy, October 5–7, 2015. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9538, 299-311 (2016).
PDFBibTeX XMLCite
Full Text: DOI

Shrinking maxima, decreasing costs: new online packing and covering problems. (English) Zbl 1335.68297

Raghavendra, Prasad (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 16th international workshop, APPROX 2013, and 17th international workshop, RANDOM 2013, Berkeley, CA, USA, August 21–23, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40327-9/pbk). Lecture Notes in Computer Science 8096, 158-172 (2013).
PDFBibTeX XMLCite
Full Text: DOI

Maximizing barrier coverage lifetime with mobile sensors. (English) Zbl 1394.68009

Bodlaender, Hans L. (ed.) et al., Algorithms – ESA 2013. 21st annual European symposium, Sophia Antipolis, France, September 2–4, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40449-8/pbk). Lecture Notes in Computer Science 8125, 97-108 (2013).
MSC:  68M10 68Q17 68U05
PDFBibTeX XMLCite
Full Text: DOI

Design and analysis of algorithms. First Mediterranean conference on algorithms, MedAlg 2012, Kibbutz Ein Gedi, Israel, December 3–5, 2012. Proceedings. (English) Zbl 1259.68004

Lecture Notes in Computer Science 7659. Berlin: Springer (ISBN 978-3-642-34861-7/pbk). x, 261 p. (2012).
MSC:  68-06 68Wxx 00B25
PDFBibTeX XMLCite
Full Text: DOI

Growing half-balls: minimizing storage and communication costs in CDNs. (English) Zbl 1367.68016

Czumaj, Artur (ed.) et al., Automata, languages, and programming. 39th international colloquium, ICALP 2012, Coventry, UK, July 9–13, 2012. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-31584-8/pbk). Lecture Notes in Computer Science 7392, 416-427 (2012).
MSC:  68M11 68W25
PDFBibTeX XMLCite
Full Text: DOI

Changing of the guards: strip cover with duty cycling. (English) Zbl 1332.68020

Even, Guy (ed.) et al., Structural information and communication complexity. 19th international colloquium, SIROCCO 2012, Reykjavik, Iceland, June 30–July 2, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-31103-1/pbk). Lecture Notes in Computer Science 7355, 36-47 (2012).
MSC:  68M20 68W25
PDFBibTeX XMLCite
Full Text: DOI Link

Competitive router scheduling with structured data. (English) Zbl 1242.68040

Solis-Oba, Roberto (ed.) et al., Approximation and online algorithms. 9th international workshop, WAOA 2011, Saarbrücken, Germany, September 8–9, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-29115-9/pbk). Lecture Notes in Computer Science 7164, 219-232 (2012).
MSC:  68M20 68W27
PDFBibTeX XMLCite
Full Text: DOI

Online scheduling with interval conflicts. (English) Zbl 1230.68054

Schwentick, Thomas (ed.) et al., STACS 2011. 28th international symposium on theoretical aspects of computer science, Dortmund, Germany, March 10–12, 2011. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-25-5). LIPIcs – Leibniz International Proceedings in Informatics 9, 472-483, electronic only (2011).
PDFBibTeX XMLCite
Full Text: DOI Link

Online set packing and competitive scheduling of multi-part tasks. (English) Zbl 1315.68035

Proceedings of the 29th annual ACM SIGACT-SIGOPS symposium on principles of distributed computing, PODC ’10, Zurich, Switzerland, July 25–28, 2010. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-888-9). 440-449 (2010).
PDFBibTeX XMLCite
Full Text: DOI

Minimum vertex cover in rectangle graphs. (English) Zbl 1287.05143

de Berg, Mark (ed.) et al., Algorithms – ESA 2010. 18th annual European symposium, Liverpool, UK, September 6–8, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-15774-5/pbk). Lecture Notes in Computer Science 6346, 255-266 (2010).
MSC:  05C85 05C70 68W25
PDFBibTeX XMLCite
Full Text: DOI Link

Vector bin packing with multiple-choice (extended abstract). (English) Zbl 1285.68217

Kaplan, Haim (ed.), Algorithm theory – SWAT 2010. 12th Scandinavian symposium and workshops on algorithm theory, Bergen, Norway, June 21–23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13730-3/pbk). Lecture Notes in Computer Science 6139, 248-259 (2010).
MSC:  68W25 90C59
PDFBibTeX XMLCite
Full Text: DOI

Optimization problems in multiple subtree graphs. (English) Zbl 1284.68669

Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 7th international workshop, WAOA 2009, Copenhagen, Denmark, September 10–11, 2009. Revised papers. Berlin: Springer (ISBN 978-3-642-12449-5/pbk). Lecture Notes in Computer Science 5893, 194-204 (2010).
PDFBibTeX XMLCite
Full Text: DOI

Extension of the Nemhauser and Trotter theorem to generalized vertex cover with applications. (English) Zbl 1284.68653

Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 7th international workshop, WAOA 2009, Copenhagen, Denmark, September 10–11, 2009. Revised papers. Berlin: Springer (ISBN 978-3-642-12449-5/pbk). Lecture Notes in Computer Science 5893, 13-24 (2010).
MSC:  68W25 05C85 68R10
PDFBibTeX XMLCite
Full Text: DOI

Rent, lease or buy: randomized algorithms for multislope ski rental. (English) Zbl 1259.68231

Albers, Susanne (ed.) et al., STACS 2008. 25th international symposium on theoretical aspects of computer science, Bordeaux, France, February 21–23, 2008. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-06-4). LIPIcs – Leibniz International Proceedings in Informatics 1, 503-514, electronic only (2008).
MSC:  68W20 90C27
PDFBibTeX XMLCite
Full Text: DOI

The minimum substring cover problem. (English) Zbl 1130.68100

Kaklamanis, Christos (ed.) et al., Approximation and online algorithms. 5th international workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised papers. Berlin: Springer (ISBN 978-3-540-77917-9/pbk). Lecture Notes in Computer Science 4927, 170-183 (2008).
MSC:  68W25 68Q45 92D20
PDFBibTeX XMLCite
Full Text: DOI

Optimization problems in multiple-interval graphs. (English) Zbl 1302.05179

Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2007, New Orleans, LA, USA, January 7–9, 2007. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-89871-624-5). 268-277 (2007).
PDFBibTeX XMLCite

On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems. (English) Zbl 1151.68341

Arge, Lars (ed.) et al., Algorithms – ESA 2007. 15th annual European symposium, Eilat, Israel, October 8–10, 2007, Proceedings. Berlin: Springer (ISBN 978-3-540-75519-7/pbk). Lecture Notes in Computer Science 4698, 570-581 (2007).
MSC:  68M20 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Approximation of partial capacitated vertex cover. (English) Zbl 1151.90566

Arge, Lars (ed.) et al., Algorithms – ESA 2007. 15th annual European symposium, Eilat, Israel, October 8–10, 2007, Proceedings. Berlin: Springer (ISBN 978-3-540-75519-7/pbk). Lecture Notes in Computer Science 4698, 335-346 (2007).
MSC:  90C35 68W25 90C59
PDFBibTeX XMLCite
Full Text: DOI

Resource allocation in bounded degree trees. (English) Zbl 1131.68478

Azar, Yossi (ed.) et al., Algorithms – ESA 2006. 14th annual European symposium, Zurich, Switzerland, September 11–13, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-38875-3/pbk). Lecture Notes in Computer Science 4168, 64-75 (2006).
MSC:  68R10 68W20 68W25
PDFBibTeX XMLCite
Full Text: DOI

Approximation algorithms for capacitated rectangle stabbing. (English) Zbl 1183.68742

Calamoneri, Tiziana (ed.) et al., Algorithms and complexity. 6th Italian conference, CIAC 2006, Rome, Italy, May 29–31, 2006. Proceedings. Berlin: Springer (ISBN 3-540-34375-X/pbk). Lecture Notes in Computer Science 3998, 18-29 (2006).
MSC:  68W25 68U05
PDFBibTeX XMLCite
Full Text: DOI

Improved approximation algorithm for convex recoloring of trees. (English) Zbl 1125.68427

Erlebach, Thomas (ed.) et al., Approximation and online algorithms. Third international workshop, WAOA 2005, Palma de Mallorca, Spain, October 6–7, 2005. Revised papers. Berlin: Springer (ISBN 3-540-32207-8/pbk). Lecture Notes in Computer Science 3879, 55-68 (2006).
MSC:  68W25 05C15
PDFBibTeX XMLCite
Full Text: DOI

Combinatorial interpretations of dual fitting and primal fitting. (English) Zbl 1173.68588

Jansen, Klaus (ed.) et al., Approximation and online algorithms. First international workshop, WAOA 2003, Budapest, Hungary, September 16–18, 2003. Revised papers. Berlin: Springer (ISBN 3-540-21079-2/pbk). Lecture Notes in Computer Science 2909, 137-150 (2004).
MSC:  68R05 68W25 90B80
PDFBibTeX XMLCite
Full Text: DOI

The hardness of cache conscious data placement. (English) Zbl 1323.68320

Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL ’02, Portland, OR, USA, January 16–18, 2002. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-450-9). 101-112 (2002).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software