×

Found 33 Documents (Results 1–33)

Barrier coverage with uniform radii in 2D. (English) Zbl 1503.68280

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, 57-69 (2017).
MSC:  68U05 68W25
PDFBibTeX XMLCite
Full Text: DOI

Precedence-constrained min sum set cover. (English) Zbl 1457.68222

Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 55, 12 p. (2017).
MSC:  68R10 68W25
PDFBibTeX XMLCite
Full Text: DOI

Barrier coverage with non-uniform lengths to minimize aggregate movements. (English) Zbl 1457.68290

Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 37, 13 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

How unsplittable-flow-covering helps scheduling with job-dependent cost functions. (English) Zbl 1386.90055

Esparza, Javier (ed.) et al., Automata, languages, and programming. 41st international colloquium, ICALP 2014, Copenhagen, Denmark, July 8–11, 2014. Proceedings, Part I. Berlin: Springer (ISBN 978-3-662-43947-0/pbk). Lecture Notes in Computer Science 8572, 625-636 (2014).
MSC:  90B35 68W25
PDFBibTeX XMLCite
Full Text: DOI Link

On tree-constrained matchings and generalizations. (English) Zbl 1332.68057

Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4–8, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-22005-0/pbk). Lecture Notes in Computer Science 6755, 98-109 (2011).
PDFBibTeX XMLCite
Full Text: DOI HAL

A polynomial delay algorithm for enumerating approximate solutions to the interval constrained coloring problem. (English) Zbl 1430.68446

Blelloch, Guy (ed.) et al., Proceedings of the 12th workshop on algorithm engineering and experiments (ALENEX ’10), Austin, TX, USA, January 16, 2010. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 23-33 (2010).
PDFBibTeX XMLCite
Full Text: DOI Link

The checkpoint problem. (English) Zbl 1306.90128

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, 219-231 (2010).
PDFBibTeX XMLCite
Full Text: DOI

When LP is the cure for your matching woes: improved bounds for stochastic matchings (extended abstract). (English) Zbl 1287.05111

de Berg, Mark (ed.) et al., Algorithms – ESA 2010. 18th annual European symposium, Liverpool, UK, September 6–8, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-15780-6/pbk). Lecture Notes in Computer Science 6347, 218-229 (2010).
PDFBibTeX XMLCite
Full Text: DOI

Improved approximations for guarding 1.5-dimensional terrains. (English) Zbl 1236.68296

Albers, Susanne (ed.) et al., STACS 2009. 26th international symposium on theoretical aspects of computer science, Freiburg, Germany, February 26–28, 2009. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-09-5). LIPIcs – Leibniz International Proceedings in Informatics 3, 361-372, electronic only (2009).
MSC:  68W25 90C05
PDFBibTeX XMLCite
Full Text: DOI Link

Lagrangian relaxation and partial cover (Extended abstract). (English) Zbl 1259.68239

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, 12 p., electronic only (2008).
MSC:  68W25 68W40 90C27
PDFBibTeX XMLCite
Full Text: DOI Link

Adaptive local ratio. (English) Zbl 1192.90181

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). 152-160 (2008).
MSC:  90C27 68W25 90C35
PDFBibTeX XMLCite

Approximating the interval constrained coloring problem. (English) Zbl 1155.68573

Gudmundsson, Joachim (ed.), Algorithm theory – SWAT 2008. 11th Scandinavian workshop on algorithm theory, Gothenburg, Sweden, July 2–4, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-69900-2/pbk). Lecture Notes in Computer Science 5124, 210-221 (2008).
MSC:  68W25 68Q25 92C40
PDFBibTeX XMLCite
Full Text: DOI Link

To fill or not to fill: The gas station problem. (Extended abstract). (English) Zbl 1151.90570

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, 534-545 (2007).
MSC:  90C35 68Q25 68W25
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

Combinatorial algorithms for data migration to minimize average completion time. (English) Zbl 1155.68576

Díaz, Josep (ed.) et al., Approximation, randomization and combinatorial optimization. Algorithms and techniques. 9th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2006, and 10th international workshop on randomization and computation, RANDOM 2006, Barcelona, Spain, August 28–30, 2006. Proceedings. Berlin: Springer (ISBN 3-540-38044-2/pbk). Lecture Notes in Computer Science 4110, 128-139 (2006).
MSC:  68W25 90C27
PDFBibTeX XMLCite
Full Text: DOI Link

A primal-dual approximation algorithm for partial vertex cover: making educated guesses. (English) Zbl 1142.90494

Chekuri, Chandra (ed.) et al., Approximation, randomization and combinatorial optimization. Algorithms and techniques. 8th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2005, and 9th international workshop on randomization and computation, RANDOM 2005, Berkeley, CA, USA, August 22–24, 2005. Proceedings. Berlin: Springer (ISBN 3-540-28239-4/pbk). Lecture Notes in Computer Science 3624, 182-191 (2005).
MSC:  90C35 05C85 68W25
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

Software