×

Found 76 Documents (Results 1–76)

Latin 2024: theoretical informatics. 16th Latin American symposium, Puerto Varas, Chile, March 18–22, 2024. Proceedings. Part II. (English) Zbl 07815698

Lecture Notes in Computer Science 14579. Cham: Springer (ISBN 978-3-031-55600-5/pbk; 978-3-031-55601-2/ebook). xix, 350 p. (2024).
PDFBibTeX XMLCite
Full Text: DOI

Latin 2024: theoretical informatics. 16th Latin American symposium, Puerto Varas, Chile, March 18–22, 2024. Proceedings. Part I. (English) Zbl 07815697

Lecture Notes in Computer Science 14578. Cham: Springer (ISBN 978-3-031-55597-8/pbk; 978-3-031-55598-5/ebook). xix, 352 p. (2024).
PDFBibTeX XMLCite
Full Text: DOI

A PTAS for unsplittable flow on a path. (English) Zbl 07774340

Leonardi, Stefano (ed.) et al., Proceedings of the 54th annual ACM SIGACT symposium on theory of computing, STOC ’22, Rome, Italy June 20–24, 2022. New York, NY: Association for Computing Machinery (ACM). 289-302 (2022).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Fully dynamic algorithms for knapsack problems with polylogarithmic update time. (English) Zbl 07799596

Bojańczyk, Mikołaj (ed.) et al., 41st IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2021, virtual conference, December 15–17, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 213, Article 18, 17 p. (2021).
MSC:  68N30 68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

A \((2+\varepsilon)\)-approximation algorithm for preemptive weighted flow time on a single machine. (English) Zbl 07765230

Khuller, Samir (ed.) et al., Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC ’21, virtual, Italy, June 21–25, 2021. New York, NY: Association for Computing Machinery (ACM). 1042-1055 (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

FPT and FPT-approximation algorithms for unsplittable flow on trees. (English) Zbl 07740922

Mutzel, Petra (ed.) et al., 29th annual European symposium on algorithms. ESA 2021, Lisbon, Portugal (virtual conference), September 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 204, Article 67, 15 p. (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Faster \((1+ \varepsilon)\)-approximation for unsplittable flow on a path via resource augmentation and back. (English) Zbl 07740904

Mutzel, Petra (ed.) et al., 29th annual European symposium on algorithms. ESA 2021, Lisbon, Portugal (virtual conference), September 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 204, Article 49, 15 p. (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles. (English) Zbl 07760180

Cabello, Sergio (ed.) et al., 36th international symposium on computational geometry, SoCG 2020, Zürich, Switzerland (virtual conference), June 23–26, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 164, Article 51, 14 p. (2020).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Better approximations for general caching and UFP-cover under resource augmentation. (English) Zbl 07650929

Paul, Christophe (ed.) et al., 37th international symposium on theoretical aspects of computer science, STACS 2020, Montpellier, France, March 10–13, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 154, Article 44, 14 p. (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Fixed-parameter algorithms for unsplittable flow cover. (English) Zbl 07650927

Paul, Christophe (ed.) et al., 37th international symposium on theoretical aspects of computer science, STACS 2020, Montpellier, France, March 10–13, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 154, Article 42, 17 p. (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Packing cars into narrow roads: PTASs for limited supply highway. (English) Zbl 07525491

Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 54, 14 p. (2019).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Parameterized approximation schemes for independent set of rectangles and geometric knapsack. (English) Zbl 07525490

Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 53, 16 p. (2019).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs. (English) Zbl 1524.68239

Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 65, 13 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Fixed-parameter approximation schemes for weighted flowtime. (English) Zbl 1521.68260

Blais, Eric (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 21st international workshop, APPROX 2018, and 22nd international workshop, RANDOM 2018 August 20–22, 2018, Princeton, USA. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 116, Article 28, 19 p. (2018).
MSC:  68W25 68Q27 90B35
PDFBibTeX XMLCite
Full Text: DOI

A \((5/3+\varepsilon)\)-approximation for unsplittable flow on a path: placing small tasks into boxes. (English) Zbl 1422.68298

Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 607-619 (2018).
PDFBibTeX XMLCite
Full Text: DOI

On minimizing the makespan when some jobs cannot be assigned on the same machine. (English) Zbl 1442.90071

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 31, 14 p. (2017).
MSC:  90B35 68W25
PDFBibTeX XMLCite
Full Text: DOI

A \((1+\varepsilon)\)-approximation for unsplittable flow on a path in fixed-parameter running time. (English) Zbl 1441.68291

Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 67, 13 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

A QPTAS for the general scheduling problem with identical release dates. (English) Zbl 1441.68287

Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 31, 14 p. (2017).
MSC:  68W25 90B35
PDFBibTeX XMLCite
Full Text: DOI

Approximation and parameterized algorithms for geometric independent set with shrinking. (English) Zbl 1441.68270

Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 42, 13 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

To augment or not to augment: solving unsplittable flow on a path by creating slack. (English) Zbl 1411.68188

Klein, Philip N. (ed.), Proceedings of the 28th annual ACM-SIAM symposium on discrete algorithms, SODA 2017, Barcelona, Spain, January 16–19, 2017. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 2411-2422 (2017).
PDFBibTeX XMLCite
Full Text: DOI

Faster approximation schemes for the two-dimensional knapsack problem. (English) Zbl 1411.68190

Klein, Philip N. (ed.), Proceedings of the 28th annual ACM-SIAM symposium on discrete algorithms, SODA 2017, Barcelona, Spain, January 16–19, 2017. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 79-98 (2017).
MSC:  68W25 68Q25 90C27
PDFBibTeX XMLCite
Full Text: DOI

On approximating strip packing with a better ratio than 3/2. (English) Zbl 1394.68442

Krauthgamer, Robert (ed.), Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10–12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-433-1). 1491-1510 (2016).
MSC:  68W25 90C27
PDFBibTeX XMLCite
Full Text: DOI

This house proves that debating is harder than soccer. (English) Zbl 1369.68245

Demaine, Erik D. (ed.) et al., 8th international conference on fun with algorithms, FUN 2016, La Maddalena, Italy, June 8–10, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-005-7). LIPIcs – Leibniz International Proceedings in Informatics 49, Article 25, 14 p. (2016).
MSC:  68Q25 68Q17 68R05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Semidefinite and linear programming integrality gaps for scheduling identical machines. (English) Zbl 1402.90054

Louveaux, Quentin (ed.) et al., Integer programming and combinatorial optimization. 18th international conference, IPCO 2016, Liège, Belgium, June 1–3, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-33460-8/pbk; 978-3-319-33461-5/ebook). Lecture Notes in Computer Science 9682, 152-163 (2016).
PDFBibTeX XMLCite
Full Text: DOI

Independent Set of Convex Polygons: from \(n^{\epsilon }\) to \(1+\epsilon\) via shrinking. (English) Zbl 1383.68094

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, 700-711 (2016).
MSC:  68U05 68Q25 68W25
PDFBibTeX XMLCite
Full Text: DOI

New approximation schemes for unsplittable flow on a path. (English) Zbl 1372.68296

Indyk, Piotr (ed.), Proceedings of the 26th annual ACM-SIAM symposium on discrete algorithms, SODA 2015, Portland, San Diego, CA, January 4–6, 2015. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-374-7; 978-1-61197-373-0/ebook). 47-58 (2015).
MSC:  68W25 05C21 05C85
PDFBibTeX XMLCite
Full Text: DOI

A quasi-PTAS for the two-dimensional geometric knapsack problem. (English) Zbl 1371.90115

Indyk, Piotr (ed.), Proceedings of the 26th annual ACM-SIAM symposium on discrete algorithms, SODA 2015, Portland, San Diego, CA, January 4–6, 2015. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-374-7; 978-1-61197-373-0/ebook). 1491-1505 (2015).
MSC:  90C27 68W25
PDFBibTeX XMLCite
Full Text: DOI

How to tame rectangles: solving independent set and coloring of rectangles via shrinking. (English) Zbl 1375.68117

Garg, Naveen (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. Proceedings of the 18th international workshop on approximation algorithms for combinatorial optimization problems (APPROX 2015) and the 19th international workshop on randomization and computation (RANDOM 2015), Princeton, NJ, USA, August 24–26, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-89-7). LIPIcs – Leibniz International Proceedings in Informatics 40, 43-60 (2015).
MSC:  68U05 68Q25 68W25
PDFBibTeX XMLCite
Full Text: DOI

On guillotine cutting sequences. (English) Zbl 1375.68116

Garg, Naveen (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. Proceedings of the 18th international workshop on approximation algorithms for combinatorial optimization problems (APPROX 2015) and the 19th international workshop on randomization and computation (RANDOM 2015), Princeton, NJ, USA, August 24–26, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-89-7). LIPIcs – Leibniz International Proceedings in Informatics 40, 1-19 (2015).
PDFBibTeX XMLCite
Full Text: DOI

A \((2+\varepsilon)\)-approximation algorithm for the storage allocation problem. (English) Zbl 1440.68336

Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 9134, 973-984 (2015).
PDFBibTeX XMLCite
Full Text: DOI

A QPTAS for maximum weight independent set of polygons with polylogarithmically many vertices. (English) Zbl 1422.68229

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

A mazing \(2+\varepsilon\) approximation for unsplittable flow on a path. (English) Zbl 1422.68279

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). 26-41 (2014).
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

Scheduling and fixed-parameter tractability. (English) Zbl 1332.68088

Lee, Jon (ed.) et al., Integer programming and combinatorial optimization. 17th international conference, IPCO 2014, Bonn, Germany, June 22–24, 2014. Proceedings. Berlin: Springer (ISBN 978-3-319-07556-3/pbk). Lecture Notes in Computer Science 8494, 381-392 (2014).
PDFBibTeX XMLCite
Full Text: DOI arXiv

A new approach to online scheduling: approximating the optimal competitive ratio. (English) Zbl 1421.68247

Khanna, Sanjeev (ed.), Proceedings of the 24th annual ACM-SIAM symposium on discrete algorithms, SODA 2013, New Orleans, LA, USA, January 6–8, 2013. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 118-128 (2013).
MSC:  68W27 68W20 90B35
PDFBibTeX XMLCite
Full Text: DOI arXiv

Scheduling with an orthogonal resource constraint. (English) Zbl 1394.68048

Erlebach, Thomas (ed.) et al., Approximation and online algorithms. 10th international workshop, WAOA 2012, Ljubljana, Slovenia, September 13–14, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-38015-0/pbk). Lecture Notes in Computer Science 7846, 242-256 (2013).
MSC:  68M20 68W25
PDFBibTeX XMLCite
Full Text: DOI Link

Approximating the configuration-LP for minimizing weighted sum of completion times on unrelated machines. (English) Zbl 1377.90034

Goemans, Michel (ed.) et al., Integer programming and combinatorial optimization. 16th international conference, IPCO 2013, Valparaíso, Chile, March 18–20, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-36693-2/pbk). Lecture Notes in Computer Science 7801, 387-398 (2013).
MSC:  90B35 68W25 90C05
PDFBibTeX XMLCite
Full Text: DOI

The power of recourse for online MST and TSP. (English) Zbl 1272.68472

Czumaj, Artur (ed.) et al., Automata, languages, and programming. 39th international colloquium, ICALP 2012, Warwick, UK, July 9–13, 2012. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-31593-0/pbk). Lecture Notes in Computer Science 7391, 689-700 (2012).
MSC:  68W27 90C27 90C35
PDFBibTeX XMLCite
Full Text: DOI

Assigning sporadic tasks to unrelated parallel machines. (English) Zbl 1272.68069

Czumaj, Artur (ed.) et al., Automata, languages, and programming. 39th international colloquium, ICALP 2012, Warwick, UK, July 9–13, 2012. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-31593-0/pbk). Lecture Notes in Computer Science 7391, 665-676 (2012).
MSC:  68M20 68Q25
PDFBibTeX XMLCite
Full Text: DOI

A constant factor approximation algorithm for unsplittable flow on paths. (English) Zbl 1292.68162

Ostrovsky, Rafail (ed.), Proceedings of the 2011 IEEE 52nd annual symposium on foundations of computer science – FOCS 2011, Palm Springs, CA, USA, October 22–25. Los Alamitos, CA: IEEE Computer Society (ISBN 978-0-7695-4571-4; 978-1-4577-1843-4/ebook). 47-56 (2011).
PDFBibTeX XMLCite
Full Text: DOI

On the configuration-LP for scheduling on unrelated machines. (English) Zbl 1348.90317

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, 530-542 (2011).
MSC:  90B35 68W25 90C05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Universal packet routing with arbitrary bandwidths and transit times. (English) Zbl 1341.68007

Günlük, Oktay (ed.) et al., Integer programming and combinatoral optimization. 15th international conference, IPCO 2011, New York, NY, USA, June 15–17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20806-5/pbk). Lecture Notes in Computer Science 6655, 362-375 (2011).
MSC:  68M10 68M20 68R10
PDFBibTeX XMLCite
Full Text: DOI Link

Throughput maximization for periodic packet routing on trees and grids. (English) Zbl 1314.68094

Jansen, Klaus (ed.) et al., Approximation and online algorithms. 8th international workshop, WAOA 2010, Liverpool, UK, September 9–10, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-18317-1/pbk). Lecture Notes in Computer Science 6534, 213-224 (2011).
MSC:  68M20 68W25 90B35
PDFBibTeX XMLCite
Full Text: DOI

Increasing speed scheduling and flow scheduling. (English) Zbl 1311.90053

Cheong, Otfried (ed.) et al., Algorithms and computation. 21st international symposium, ISAAC 2010, Jeju, Korea, December 15–17, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-17513-8/pbk). Lecture Notes in Computer Science 6507, 279-290 (2010).
MSC:  90B35 68W25
PDFBibTeX XMLCite
Full Text: DOI Link

Policies for periodic packet routing. (English) Zbl 1310.68049

Cheong, Otfried (ed.) et al., Algorithms and computation. 21st international symposium, ISAAC 2010, Jeju, Korea, December 15–17, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-17513-8/pbk). Lecture Notes in Computer Science 6507, 266-278 (2010).
MSC:  68M20 90B35
PDFBibTeX XMLCite
Full Text: DOI

Scheduling periodic tasks in a hard real-time environment. (English) Zbl 1288.90026

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, 299-311 (2010).
MSC:  90B35 68W25
PDFBibTeX XMLCite
Full Text: DOI Link

Packet routing: complexity and algorithms. (English) Zbl 1284.68093

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, 217-228 (2010).
PDFBibTeX XMLCite
Full Text: DOI Link

Packet routing on the grid. (English) Zbl 1283.68272

López-Ortiz, Alejandro (ed.), LATIN 2010: Theoretical informatics. 9th Latin American symposium, Oaxaca, Mexico, April 19–23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-12199-9/pbk). Lecture Notes in Computer Science 6034, 120-130 (2010).
PDFBibTeX XMLCite
Full Text: DOI

Local algorithms for edge colorings in UDGs. (English) Zbl 1273.68279

Paul, Christophe (ed.) et al., Graph-theoretic concepts in computer science. 35th international workshop, WG 2009, Montpellier, France, June 24–26, 2009. Revised papers. Berlin: Springer (ISBN 978-3-642-11408-3/pbk). Lecture Notes in Computer Science 5911, 202-213 (2010).
MSC:  68R10 05C15 05C85
PDFBibTeX XMLCite
Full Text: DOI

Real-time message routing and scheduling. (English) Zbl 1255.68047

Dinur, Irit (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 12th international workshop, APPROX 2009, and 13th international workshop, RANDOM 2009, Berkeley, CA, USA, August 21–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03684-2/pbk). Lecture Notes in Computer Science 5687, 217-230 (2009).
MSC:  68M20 68R10
PDFBibTeX XMLCite
Full Text: DOI Link

Local PTAS for dominating and connected dominating set in location aware unit disk graphs. (English) Zbl 1209.68655

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, 227-240 (2009).
MSC:  68W25 05C69 05C85
PDFBibTeX XMLCite
Full Text: DOI

Optimal movement of mobile sensors for barrier coverage of a planar region. (Extended abstract). (English) Zbl 1168.68589

Yang, Boting (ed.) et al., Combinatorial optimization and applications. Second international conference, COCOA 2008, St. John’s, NL, Canada, August 21–24, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85096-0/pbk). Lecture Notes in Computer Science 5165, 103-115 (2008).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Local construction and coloring of spanners of location aware unit disk graphs (extended abstract). (English) Zbl 1202.05048

Broersma, Hajo (ed.) et al., Graph-theoretic concepts in computer science. 34th international workshop, WG 2008, Durham, UK, June 30–July 2, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-92247-6/pbk). Lecture Notes in Computer Science 5344, 372-383 (2008).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Software