×

Found 145 Documents (Results 1–100)

Classification via two-way comparisons (extended abstract). (English) Zbl 07789710

Morin, Pat (ed.) et al., Algorithms and data structures. 18th international symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 14079, 275-290 (2023).
MSC:  68P05 68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Better hardness results for the minimum spanning tree congestion problem. (English) Zbl 07770290

Lin, Chun-Cheng (ed.) et al., WALCOM: algorithms and computation. 17th international conference and workshops, WALCOM 2023, Hsinchu, Taiwan, March 22–24, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13973, 167-178 (2023).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

A waste-efficient algorithm for single-droplet sample preparation on microfluidic chips. (English) Zbl 07224273

Rahman, M. Sohel (ed.) et al., WALCOM: algorithms and computation. 14th international conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12049, 55-68 (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Better bounds for online line chasing. (English) Zbl 07561652

Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 8, 13 p. (2019).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Towards a theory of mixing graphs: a characterization of perfect mixability (extended abstract). (English) Zbl 1454.68099

Heggernes, Pinar (ed.), Algorithms and complexity. 11th international conference, CIAC 2019, Rome, Italy, May 27–29, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11485, 187-198 (2019).
PDFBibTeX XMLCite
Full Text: DOI

A \(\phi\)-competitive algorithm for scheduling packets with deadlines. (English) Zbl 1431.68165

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). 123-142 (2019).
MSC:  68W27 90B35
PDFBibTeX XMLCite
Full Text: DOI arXiv

Algorithms for sensor systems. 12th international symposium on algorithms and experiments for wireless sensor networks, ALGOSENSORS 2016, Aarhus, Denmark, August 25–26, 2016. Revised selected papers. (English) Zbl 1355.68013

Lecture Notes in Computer Science 10050. Cham: Springer (ISBN 978-3-319-53057-4/pbk; 978-3-319-53058-1/ebook). xi, 141 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

Online packet scheduling with bounded delay and lookahead. (English) Zbl 1398.68064

Seok-Hee Hong (ed.), 27th international symposium on algorithms and computation, ISAAC 2016, Sydney, Australia, December 12–14, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-026-2). LIPIcs – Leibniz International Proceedings in Informatics 64, Article 21, 13 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Online algorithms for multi-level aggregation. (English) Zbl 1397.68227

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 12, 17 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Faster information gathering in ad-hoc radio tree networks. (English) Zbl 1358.68023

Kranakis, Evangelos (ed.) et al., LATIN 2016: theoretical informatics. 12th Latin American symposium, Ensenada, Mexico, April 11–15, 2016. Proceedings. Berlin: Springer (ISBN 978-3-662-49528-5/pbk; 978-3-662-49529-2/ebook). Lecture Notes in Computer Science 9644, 275-289 (2016).
MSC:  68M10 90B18
PDFBibTeX XMLCite
Full Text: DOI arXiv

Optimal search trees with 2-way comparisons. (English) Zbl 1472.68044

Elbassioni, Khaled (ed.) et al., Algorithms and computation. 26th international symposium, ISAAC 2015, Nagoya, Japan, December 9–11, 2015. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9472, 71-82 (2015).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Competitive strategies for online clique clustering. (English) Zbl 1435.68387

Paschos, Vangelis Th. (ed.) et al., Algorithms and complexity. 9th international conference, CIAC 2015, Paris, France, May 20–22, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9079, 101-113 (2015).
PDFBibTeX XMLCite
Full Text: DOI Link

Group search on the line. (English) Zbl 1410.68159

Italiano, Giuseppe F. (ed.) et al., SOFSEM 2015: theory and practice of computer science. 41st international conference on current trends in theory and practice of computer science, Pec pod Sněžkou, Czech Republic, January 24–29, 2015. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8939, 164-176 (2015).
MSC:  68Q25 90B40
PDFBibTeX XMLCite
Full Text: DOI

Better approximation bounds for the joint replenishment problem. (English) Zbl 1423.68589

Chekuri, Chandra (ed.), Proceedings of the 25th annual ACM-SIAM symposium on discrete algorithms, SODA 2014, Portland, OR, USA, January 5–7, 2014. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 42-54 (2014).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Information gathering in ad-hoc radio networks with tree topology. (English) Zbl 1358.68024

Zhang, Zhao (ed.) et al., Combinatorial optimization and applications. 8th international conference, COCOA 2014, Wailea, Maui, HI, USA, December 19–21, 2014. Proceedings. Cham: Springer (ISBN 978-3-319-12690-6/pbk; 978-3-319-12691-3/ebook). Lecture Notes in Computer Science 8881, 129-145 (2014).
MSC:  68M10 05C82 90B18
PDFBibTeX XMLCite
Full Text: DOI

Online control message aggregation in chain networks. (English) Zbl 1391.68014

Dehne, Frank (ed.) et al., Algorithms and data structures. 13th international symposium, WADS 2013, London, ON, Canada, August 12–14, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40103-9/pbk). Lecture Notes in Computer Science 8037, 133-145 (2013).
PDFBibTeX XMLCite
Full Text: DOI

Approximation algorithms for the joint replenishment problem with deadlines. (English) Zbl 1336.68289

Fomin, Fedor V. (ed.) et al., Automata, languages, and programming. 40th international colloquium, ICALP 2013, Riga, Latvia, July 8–12, 2013, Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-39205-4/pbk). Lecture Notes in Computer Science 7965, 135-147 (2013).
MSC:  68W25 68Q17 90B06
PDFBibTeX XMLCite
Full Text: DOI arXiv

LP-rounding algorithms for the fault-tolerant facility placement problem (extended abstract). (English) Zbl 1382.90049

Spirakis, Paul G. (ed.) et al., Algorithms and complexity. 8th international conference, CIAC 2013, Barcelona, Spain, May 22–24, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38232-1/pbk). Lecture Notes in Computer Science 7878, 370-381 (2013).
MSC:  90B80 68W25
PDFBibTeX XMLCite
Full Text: DOI

A greedy approximation algorithm for minimum-gap scheduling. (English) Zbl 1382.68331

Spirakis, Paul G. (ed.) et al., Algorithms and complexity. 8th international conference, CIAC 2013, Barcelona, Spain, May 22–24, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38232-1/pbk). Lecture Notes in Computer Science 7878, 97-109 (2013).
MSC:  68W25 68W40 90B35
PDFBibTeX XMLCite
Full Text: DOI

Two-bounded-space bin packing revisited. (English) Zbl 1346.68254

Demetrescu, Camil (ed.) et al., Algorithms – ESA 2011. 19th annual European symposium, Saarbrücken, Germany, September 5–9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23718-8/pbk). Lecture Notes in Computer Science 6942, 263-274 (2011).
PDFBibTeX XMLCite
Full Text: DOI

Better bounds for incremental frequency allocation in bipartite graphs. (English) Zbl 1346.68144

Demetrescu, Camil (ed.) et al., Algorithms – ESA 2011. 19th annual European symposium, Saarbrücken, Germany, September 5–9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23718-8/pbk). Lecture Notes in Computer Science 6942, 251-262 (2011).
MSC:  68R10 68W27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Caching is hard – even in the fault model. (English) Zbl 1287.68054

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, 195-206 (2010).
MSC:  68Q17 68N25
PDFBibTeX XMLCite
Full Text: DOI

Tile-packing tomography is \({\mathbb{NP}}\)-hard. (English) Zbl 1286.68184

Thai, My T. (ed.) et al., Computing and combinatorics. 16th annual international conference, COCOON 2010, Nha Trang, Vietnam, July 19–21, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14030-3/pbk). Lecture Notes in Computer Science 6196, 254-263 (2010).
MSC:  68Q17 68U10 92C55
PDFBibTeX XMLCite
Full Text: DOI

Collecting weighted items from a dynamic queue. (English) Zbl 1423.68606

Mathieu, Claire (ed.), Proceedings of the 20th annual ACM-SIAM symposium on discrete algorithms, SODA 2009, New York, NY, USA, January 4–6, 2009. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1126-1135 (2009).
PDFBibTeX XMLCite
Full Text: Link

Three results on frequency assignment in linear cellular networks. (Extended abstract). (English) Zbl 1246.68267

Goldberg, Andrew V. (ed.) et al., Algorithmic aspects in information and management. 5th international conference, AAIM 2009, San Francisco, CA, USA, June 15–17, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02157-2/pbk). Lecture Notes in Computer Science 5564, 129-139 (2009).
MSC:  68W27 68M10
PDFBibTeX XMLCite
Full Text: DOI

Algorithms for placing monitors in a flow network. (Preliminary version). (English) Zbl 1246.90150

Goldberg, Andrew V. (ed.) et al., Algorithmic aspects in information and management. 5th international conference, AAIM 2009, San Francisco, CA, USA, June 15–17, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02157-2/pbk). Lecture Notes in Computer Science 5564, 114-128 (2009).
MSC:  90C35 68W25
PDFBibTeX XMLCite
Full Text: DOI

Experimental analysis of scheduling algorithms for aggregated links. (English) Zbl 1209.68705

Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 6th international workshop, WAOA 2008, Karlsruhe, Germany, September 18–19, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-93979-5/pbk). Lecture Notes in Computer Science 5426, 253-266 (2009).
PDFBibTeX XMLCite
Full Text: DOI

Randomized algorithms for buffer management with 2-bounded delay. (English) Zbl 1209.68625

Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 6th international workshop, WAOA 2008, Karlsruhe, Germany, September 18–19, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-93979-5/pbk). Lecture Notes in Computer Science 5426, 92-104 (2009).
MSC:  68W20 68M20
PDFBibTeX XMLCite
Full Text: DOI

Algorithms for temperature-aware task scheduling in microprocessor systems. (English) Zbl 1143.68341

Fleischer, Rudolf (ed.) et al., Algorithmic aspects in information and management. 4th international conference, AAIM 2008, Shanghai, China, June 23–25, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-68865-5/pbk). Lecture Notes in Computer Science 5034, 120-130 (2008).
MSC:  68M20 68Q17 90B35
PDFBibTeX XMLCite
Full Text: DOI

Better bounds for incremental medians. (English) Zbl 1130.90026

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, 207-217 (2008).
MSC:  90B80 68W25 68W40
PDFBibTeX XMLCite
Full Text: DOI

Polynomial time algorithms for minimum energy scheduling. (English) Zbl 1151.68338

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, 136-150 (2007).
MSC:  68M20
PDFBibTeX XMLCite
Full Text: DOI Link

Competitive analysis of scheduling algorithms for aggregated links. (English) Zbl 1145.68372

Correa, José R. (ed.) et al., LATIN 2006: Theoretical informatics. 7th Latin American symposium, Valdivia, Chile, March 20–24, 2006. Proceedings. Berlin: Springer (ISBN 3-540-32755-X/pbk). Lecture Notes in Computer Science 3887, 617-628 (2006).
MSC:  68M20 68W40 90B35
PDFBibTeX XMLCite
Full Text: DOI Link

Oblivious medians via online bidding. (Extended abstract). (English) Zbl 1145.68583

Correa, José R. (ed.) et al., LATIN 2006: Theoretical informatics. 7th Latin American symposium, Valdivia, Chile, March 20–24, 2006. Proceedings. Berlin: Springer (ISBN 3-540-32755-X/pbk). Lecture Notes in Computer Science 3887, 311-322 (2006).
PDFBibTeX XMLCite
Full Text: DOI

The reverse greedy algorithm for the metric \(K\)-median problem. (English) Zbl 1128.90549

Wang, Lusheng (ed.), Computing and combinatorics. 11th annual international conference, COCOON 2005, Kunming, China, August 16–29, 2005. Proceedings. Berlin: Springer (ISBN 3-540-28061-8/pbk). Lecture Notes in Computer Science 3595, 654-660 (2005).
MSC:  90B80 68W25 68W40
PDFBibTeX XMLCite
Full Text: DOI

The wake-up problem in multi-hop radio networks. (English) Zbl 1318.68050

Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2004, New Orleans, LA, USA, January 11–13, 2004. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-558-X). 992-1000 (2004).
PDFBibTeX XMLCite

Errata to: “Analysis of the harmonic algorithm for three servers”. (English) Zbl 1122.90322

Diekert, Volker (ed.) et al., STACS 2004. 21st annual symposium on theoretical aspects of computer science, Montpellier, France, March 25–27, 2004. Proceedings. Berlin: Springer (ISBN 3-540-21236-1/pbk). Lecture Notes in Computer Science 2996, 656 (2004).
MSC:  90B18 68W20 68W40
PDFBibTeX XMLCite
Full Text: DOI

Online competitive algorithms for maximizing weighted throughput of unit jobs. (English) Zbl 1122.90347

Diekert, Volker (ed.) et al., STACS 2004. 21st annual symposium on theoretical aspects of computer science, Montpellier, France, March 25–27, 2004. Proceedings. Berlin: Springer (ISBN 3-540-21236-1/pbk). Lecture Notes in Computer Science 2996, 187-198 (2004).
MSC:  90B35 68M20 68W20
PDFBibTeX XMLCite
Full Text: DOI

The greedy algorithm for the minimum common string partition problem. (English) Zbl 1106.68434

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, 84-95 (2004).
MSC:  68W25 68T20
PDFBibTeX XMLCite
Full Text: DOI

Online scheduling of equal-length jobs: Randomization and restarts help. (English) Zbl 1098.68538

Díaz, Josep (ed.) et al., Automata, languages and programming. 31st international colloquium, ICALP 2004, Turku, Finland, July 12–16, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22849-7/pbk). Lecture Notes in Computer Science 3142, 358-370 (2004).
MSC:  68M20 90B35
PDFBibTeX XMLCite
Full Text: DOI

Improved online algorithms for buffer management in QoS switches. (English) Zbl 1111.68792

Albers, Susanne (ed.) et al., Algorithms – ESA 2004. 12th annual European symposium, Bergen, Norway, September 14–17, 2004. Proceedings. Berlin: Springer (ISBN 3-540-23025-4/pbk). Lecture Notes in Computer Science 3221, 204-215 (2004).
MSC:  68W40 68M20
PDFBibTeX XMLCite
Full Text: DOI

Faster algorithms for \(k\)-medians in trees. (English) Zbl 1124.68452

Rovan, Branislav (ed.) et al., Mathematical foundations of computer science 2003. 28th international symposium, MFCS 2003, Bratislava, Slovakia, August 25–29, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40671-9/pbk). Lect. Notes Comput. Sci. 2747, 218-227 (2003).
MSC:  68W05 68R10
PDFBibTeX XMLCite
Full Text: DOI

Analysis of the Harmonic algorithm for three servers. (English) Zbl 1036.90505

Alt, Helmut (ed.) et al., STACS 2003. 20th annual symposium of theoretical aspects on computer science, Berlin, Germany, February 27 – March 1, 2003. Proceedings. Berlin: Springer (ISBN 3-540-00623-0/pbk). Lect. Notes Comput. Sci. 2607, 247-259 (2003).
MSC:  90B18 68W20 68W40
PDFBibTeX XMLCite
Full Text: Link

Preemptive scheduling in overloaded systems. (English) Zbl 1057.68542

Widmayer, Peter (ed.) et al., Automata, languages and programming. 29th international colloquium, ICALP 2002, Málaga, Spain, July 8–13, 2002. Proceedings. Berlin: Springer (ISBN 3-540-43864-5). Lect. Notes Comput. Sci. 2380, 800-811 (2002).
MSC:  68M20 90B35
PDFBibTeX XMLCite
Full Text: Link

The \(k\)-median problem for directed trees (extended abstract). (English) Zbl 0999.68536

Sgall, Jiří(ed.) et al., Mathematical foundations of computer science 2001. 26th international symposium, MFCS 2001, Mariánské Lázně, Czech Republic, August 27-31, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2136, 260-271 (2001).
MSC:  68R10 05C85
PDFBibTeX XMLCite
Full Text: Link

The buffer minimization problem for multiprocessor scheduling with conflicts. (English) Zbl 0986.68006

Orejas, Fernando (ed.) et al., Automata, languages and programming. 28th international colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2076, 862-874 (2001).
MSC:  68M20
PDFBibTeX XMLCite
Full Text: Link

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Software