Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDJukka Suomela
Person information
- affiliation: Aalto University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[j25]Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn
, Yannic Maus, Jukka Suomela, Jara Uitto:
Improved distributed degree splitting and edge coloring. Distributed Comput. 33(3-4): 293-310 (2020)- [j24]Jukka Suomela:
Using Round Elimination to Understand Locality. SIGACT News 51(3): 63-81 (2020) - [j23]Jukka Suomela:
Structural Information and Communication Complexity. Theor. Comput. Sci. 810: 1 (2020) - [c61]Will Rosenbaum, Jukka Suomela:
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems. PODC 2020: 89-98 - [c60]Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jukka Suomela:
How much does randomness help with locally checkable problems? PODC 2020: 299-308 - [c59]Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, Jukka Suomela:
Brief Announcement: Classification of Distributed Binary Labeling Problems. PODC 2020: 349-351 - [c58]Jukka Suomela:
Landscape of Locality (Invited Talk). SWAT 2020: 2:1-2:1 - [c57]Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, Jukka Suomela:
Classification of Distributed Binary Labeling Problems. DISC 2020: 17:1-17:17 - [c56]Sebastian Brandt, Barbara Keller, Joel Rybicki, Jukka Suomela, Jara Uitto:
Brief Announcement: Efficient Load-Balancing Through Distributed Token Dropping. DISC 2020: 40:1-40:3 - [c55]Yi-Jun Chang, Jan Studený, Jukka Suomela:
Brief Announcement: Distributed Graph Problems Through an Automata-Theoretic Lens. DISC 2020: 41:1-41:3 - [i47]Yi-Jun Chang, Jan Studený, Jukka Suomela:
Distributed graph problems through an automata-theoretic lens. CoRR abs/2002.07659 (2020) - [i46]Sebastian Brandt, Barbara Keller, Joel Rybicki, Jukka Suomela, Jara Uitto:
Efficient Load-Balancing through Distributed Token Dropping. CoRR abs/2005.07761 (2020)
2010 – 2019
- 2019
- [j22]Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela:
Algebraic methods in the congested clique. Distributed Comput. 32(6): 461-478 (2019) - [j21]Lorenzo Alvisi, Shlomi Dolev, Faith Ellen, Idit Keidar, Fabian Kuhn, Jukka Suomela:
Edsger W. Dijkstra Prize in Distributed Computing 2019 - Call for Nominations. Bull. EATCS 127 (2019) - [c54]Alkida Balliu, Sebastian Brandt, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, Jukka Suomela:
Lower Bounds for Maximal Matchings and Maximal Independent Sets. FOCS 2019: 481-497 - [c53]Klaus-Tycho Foerster, Juho Hirvonen, Stefan Schmid, Jukka Suomela:
On the Power of Preprocessing in Decentralized Network Optimization. INFOCOM 2019: 1450-1458 - [c52]Lorenzo Alvisi, Shlomi Dolev, Faith Ellen, Idit Keidar, Fabian Kuhn, Jukka Suomela:
2019 Edsger W. Dijkstra Prize in Distributed Computing. PODC 2019: 1 - [c51]Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Mikaël Rabie, Jukka Suomela:
The Distributed Complexity of Locally Checkable Problems on Paths is Decidable. PODC 2019: 262-271 - [c50]Alkida Balliu, Juho Hirvonen, Dennis Olivetti, Jukka Suomela:
Hardness of Minimal Symmetry Breaking in Distributed Computing. PODC 2019: 369-378 - [c49]Alkida Balliu, Juho Hirvonen, Christoph Lenzen, Dennis Olivetti, Jukka Suomela:
Locality of Not-so-Weak Coloring. SIROCCO 2019: 37-51 - [e2]Jukka Suomela:
33rd International Symposium on Distributed Computing, DISC 2019, October 14-18, 2019, Budapest, Hungary. LIPIcs 146, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-126-9 [contents] - [i45]Alkida Balliu, Sebastian Brandt, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, Jukka Suomela:
Lower bounds for maximal matchings and maximal independent sets. CoRR abs/1901.02441 (2019) - [i44]Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jukka Suomela:
How much does randomness help with locally checkable problems? CoRR abs/1902.06803 (2019) - [i43]Alkida Balliu, Juho Hirvonen, Christoph Lenzen, Dennis Olivetti, Jukka Suomela:
Locality of not-so-weak coloring. CoRR abs/1904.05627 (2019) - [i42]Will Rosenbaum, Jukka Suomela:
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems. CoRR abs/1907.08160 (2019) - [i41]Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, Jukka Suomela:
Classification of distributed binary labeling problems. CoRR abs/1911.13294 (2019) - 2018
- [j20]Jukka Suomela:
The Presburger Award for Young Scientists 2019 - Call for Nominations. Bull. EATCS 126 (2018) - [j19]Pierre Fraigniaud, Juho Hirvonen, Jukka Suomela:
Node labels in local decision. Theor. Comput. Sci. 751: 61-73 (2018) - [c48]Thomas Petig, Elad Michael Schiller, Jukka Suomela:
Changing Lanes on a Highway. ATMOS 2018: 9:1-9:15 - [c47]Janne H. Korhonen, Jukka Suomela:
Towards a Complexity Theory for the Congested Clique. SPAA 2018: 163-172 - [c46]Alkida Balliu, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Dennis Olivetti, Jukka Suomela:
New classes of distributed time complexity. STOC 2018: 1307-1318 - [c45]Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jukka Suomela:
Almost Global Problems in the LOCAL Model. DISC 2018: 9:1-9:16 - [c44]Marthe Bonamy, Paul Ouvrard, Mikaël Rabie, Jukka Suomela, Jara Uitto:
Distributed Recoloring. DISC 2018: 12:1-12:17 - [i40]Marthe Bonamy, Paul Ouvrard, Mikaël Rabie, Jukka Suomela, Jara Uitto:
Distributed Recoloring. CoRR abs/1802.06742 (2018) - [i39]Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jukka Suomela:
Almost Global Problems in the LOCAL Model. CoRR abs/1805.04776 (2018) - [i38]Alkida Balliu, Juho Hirvonen, Dennis Olivetti, Jukka Suomela:
Hardness of minimal symmetry breaking in distributed computing. CoRR abs/1811.01643 (2018) - [i37]Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Mikaël Rabie, Jukka Suomela:
The distributed complexity of locally checkable problems on paths is decidable. CoRR abs/1811.01672 (2018) - [i36]Klaus-Tycho Foerster, Juho Hirvonen, Stefan Schmid, Jukka Suomela:
On the Power of Preprocessing in Decentralized Network Optimization. CoRR abs/1812.00854 (2018) - 2017
- [j18]Juho Hirvonen, Joel Rybicki, Stefan Schmid, Jukka Suomela:
Large Cuts with Local Algorithms on Triangle-Free Graphs. Electron. J. Comb. 24(4): P4.21 (2017) - [j17]Mika Göös, Juho Hirvonen, Jukka Suomela:
Linear-in-Δ lower bounds in the LOCAL model. Distributed Comput. 30(5): 325-338 (2017) - [j16]Christoph Lenzen, Joel Rybicki, Jukka Suomela:
Efficient Counting with Optimal Resilience. SIAM J. Comput. 46(4): 1473-1500 (2017) - [c43]Tuomo Lempiäinen, Jukka Suomela:
Constant Space and Non-Constant Time in Distributed Computing. OPODIS 2017: 30:1-30:16 - [c42]Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R. J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, Przemyslaw Uznanski:
LCL Problems on Grids. PODC 2017: 101-110 - [c41]Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, Jara Uitto:
Improved Distributed Degree Splitting and Edge Coloring. DISC 2017: 19:1-19:15 - [c40]Janne H. Korhonen, Jukka Suomela:
Brief Announcement: Towards a Complexity Theory for the Congested Clique. DISC 2017: 55:1-55:3 - [i35]Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R. J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, Przemyslaw Uznanski:
LCL problems on grids. CoRR abs/1702.05456 (2017) - [i34]Janne H. Korhonen, Jukka Suomela:
Towards a complexity theory for the congested clique. CoRR abs/1705.03284 (2017) - [i33]Tuomo Lempiäinen, Jukka Suomela:
Constant Space and Non-Constant Time in Distributed Computing. CoRR abs/1705.03876 (2017) - [i32]Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, Jara Uitto:
Improved Distributed Degree Splitting and Edge Coloring. CoRR abs/1706.04746 (2017) - [i31]Jukka Kohonen, Janne H. Korhonen, Christopher Purcell, Jukka Suomela, Przemyslaw Uznanski:
Distributed Colour Reduction Revisited. CoRR abs/1709.00901 (2017) - [i30]Alkida Balliu, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Dennis Olivetti, Jukka Suomela:
New Classes of Distributed Time Complexity. CoRR abs/1711.01871 (2017) - 2016
- [j15]Danny Dolev, Keijo Heljanko, Matti Järvisalo, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, Jukka Suomela, Siert Wieringa:
Synchronous counting and computational algorithm design. J. Comput. Syst. Sci. 82(2): 310-332 (2016) - [j14]Alon Efrat, Sándor P. Fekete, Joseph S. B. Mitchell, Valentin Polishchuk, Jukka Suomela:
Improved Approximation Algorithms for Relay Placement. ACM Trans. Algorithms 12(2): 20:1-20:28 (2016) - [j13]Henning Hasemann, Juho Hirvonen, Joel Rybicki, Jukka Suomela:
Deterministic local algorithms, unique identifiers, and fractional graph colouring. Theor. Comput. Sci. 610: 204-217 (2016) - [j12]Mika Göös, Jukka Suomela:
Locally Checkable Proofs in Distributed Computing. Theory Comput. 12(1): 1-33 (2016) - [c39]Sebastian Brandt, Orr Fischer, Juho Hirvonen, Barbara Keller, Tuomo Lempiäinen, Joel Rybicki, Jukka Suomela, Jara Uitto:
A lower bound for the distributed Lovász local lemma. STOC 2016: 479-488 - [c38]Pawel Gawrychowski, Jukka Suomela, Przemyslaw Uznanski:
Randomized Algorithms for Finding a Majority Element. SWAT 2016: 9:1-9:14 - [c37]Mika Göös, Juho Hirvonen, Reut Levi, Moti Medina, Jukka Suomela:
Non-local Probes Do Not Help with Many Graph Problems. DISC 2016: 201-214 - [e1]Jukka Suomela:
Structural Information and Communication Complexity - 23rd International Colloquium, SIROCCO 2016, Helsinki, Finland, July 19-21, 2016, Revised Selected Papers. Lecture Notes in Computer Science 9988, 2016, ISBN 978-3-319-48313-9 [contents] - [i29]Pawel Gawrychowski, Jukka Suomela, Przemyslaw Uznanski:
Randomized algorithms for finding a majority element. CoRR abs/1603.01583 (2016) - 2015
- [j11]Lauri Hella, Matti Järvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiäinen, Kerkko Luosto, Jukka Suomela, Jonni Virtema:
Weak models of distributed computing, with connections to modal logic. Distributed Comput. 28(1): 31-53 (2015) - [j10]Michael A. Bender, Sándor P. Fekete, Alexander Kröller, Vincenzo Liberatore, Joseph S. B. Mitchell, Valentin Polishchuk, Jukka Suomela:
The minimum backlog problem. Theor. Comput. Sci. 605: 51-61 (2015) - [c36]Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela:
Algebraic Methods in the Congested Clique. PODC 2015: 143-152 - [c35]Christoph Lenzen, Joel Rybicki, Jukka Suomela:
Towards Optimal Synchronous Counting. PODC 2015: 441-450 - [c34]Pierre Fraigniaud, Juho Hirvonen, Jukka Suomela:
Node Labels in Local Decision. SIROCCO 2015: 31-45 - [c33]Joel Rybicki, Jukka Suomela:
Exact Bounds for Distributed Graph Colouring. SIROCCO 2015: 46-60 - [c32]Laurent Feuilloley, Juho Hirvonen, Jukka Suomela:
Locally Optimal Load Balancing. DISC 2015: 544-558 - [i28]Laurent Feuilloley, Juho Hirvonen, Jukka Suomela:
Locally Optimal Load Balancing. CoRR abs/1502.04511 (2015) - [i27]Joel Rybicki, Jukka Suomela:
Exact bounds for distributed graph colouring. CoRR abs/1502.04963 (2015) - [i26]Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela:
Algebraic Methods in the Congested Clique. CoRR abs/1503.04963 (2015) - [i25]Christoph Lenzen, Joel Rybicki, Jukka Suomela:
Towards Optimal Synchronous Counting. CoRR abs/1503.06702 (2015) - [i24]Pierre Fraigniaud, Juho Hirvonen, Jukka Suomela:
Node Labels in Local Decision. CoRR abs/1507.00909 (2015) - [i23]Sebastian Brandt, Orr Fischer, Juho Hirvonen, Barbara Keller, Tuomo Lempiäinen, Joel Rybicki, Jukka Suomela, Jara Uitto:
A Lower Bound for the Distributed Lovász Local Lemma. CoRR abs/1511.00900 (2015) - [i22]Alon Efrat, Sándor P. Fekete, Joseph S. B. Mitchell, Valentin Polishchuk, Jukka Suomela:
Improved Approximation Algorithms for Relay Placement. CoRR abs/1511.02525 (2015) - [i21]Mika Göös, Juho Hirvonen, Reut Levi, Moti Medina, Jukka Suomela:
Non-Local Probes Do Not Help with Graph Problems. CoRR abs/1512.05411 (2015) - 2014
- [j9]Mika Göös, Jukka Suomela:
No sublogarithmic-time approximation scheme for bipartite vertex cover. Distributed Comput. 27(6): 435-443 (2014) - [c31]Mika Göös, Juho Hirvonen, Jukka Suomela:
Linear-in-delta lower bounds in the LOCAL model. PODC 2014: 86-95 - [c30]Miikka Hilke, Christoph Lenzen, Jukka Suomela:
Brief announcement: local approximability of minimum dominating set on planar graphs. PODC 2014: 344-346 - [c29]Juhana Laurinharju, Jukka Suomela:
Brief announcement: linial's lower bound made easy. PODC 2014: 377-378 - [i20]Juho Hirvonen, Joel Rybicki, Stefan Schmid, Jukka Suomela:
Large Cuts with Local Algorithms on Triangle-Free Graphs. CoRR abs/1402.2543 (2014) - [i19]Miikka Hilke, Christoph Lenzen, Jukka Suomela:
Local Approximability of Minimum Dominating Set on Planar Graphs. CoRR abs/1402.2549 (2014) - [i18]Juhana Laurinharju, Jukka Suomela:
Linial's Lower Bound Made Easy. CoRR abs/1402.2552 (2014) - [i17]Jukka Suomela:
Median Filtering is Equivalent to Sorting. CoRR abs/1406.1717 (2014) - 2013
- [j8]Jukka Suomela:
Survey of local algorithms. ACM Comput. Surv. 45(2): 24:1-24:40 (2013) - [j7]Mika Göös, Juho Hirvonen, Jukka Suomela:
Lower bounds for local approximation. J. ACM 60(5): 39:1-39:23 (2013) - [c28]Pierre Fraigniaud, Mika Göös, Amos Korman, Jukka Suomela:
What can be decided locally without identifiers? PODC 2013: 157-165 - [c27]Stefan Schmid, Jukka Suomela:
Exploiting locality in distributed SDN control. HotSDN 2013: 121-126 - [c26]Danny Dolev, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, Jukka Suomela:
Synchronous Counting and Computational Algorithm Design. SSS 2013: 237-250 - [i16]Pierre Fraigniaud, Mika Göös, Amos Korman, Jukka Suomela:
What can be decided locally without identifiers? CoRR abs/1302.2570 (2013) - [i15]Mika Göös, Juho Hirvonen, Jukka Suomela:
Linear-in-$Δ$ Lower Bounds in the LOCAL Model. CoRR abs/1304.1007 (2013) - [i14]Danny Dolev, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, Jukka Suomela:
Synchronous Counting and Computational Algorithm Design. CoRR abs/1304.5719 (2013) - 2012
- [c25]Juho Hirvonen, Jukka Suomela:
Distributed maximal matching: greedy is optimal. PODC 2012: 165-174 - [c24]Mika Göös, Juho Hirvonen, Jukka Suomela:
Lower bounds for local approximation. PODC 2012: 175-184 - [c23]Lauri Hella, Matti Järvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiäinen, Kerkko Luosto, Jukka Suomela, Jonni Virtema:
Weak models of distributed computing, with connections to modal logic. PODC 2012: 185-194 - [c22]Henning Hasemann, Juho Hirvonen, Joel Rybicki, Jukka Suomela:
Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring. SIROCCO 2012: 48-60 - [c21]Mika Göös, Jukka Suomela:
No Sublogarithmic-Time Approximation Scheme for Bipartite Vertex Cover. DISC 2012: 181-194 - [i13]Mika Göös, Juho Hirvonen, Jukka Suomela:
Lower Bounds for Local Approximation. CoRR abs/1201.6675 (2012) - [i12]Lauri Hella, Matti Järvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiäinen, Kerkko Luosto, Jukka Suomela, Jonni Virtema:
Weak Models of Distributed Computing, with Connections to Modal Logic. CoRR abs/1205.2051 (2012) - [i11]Mika Göös, Jukka Suomela:
No Sublogarithmic-time Approximation Scheme for Bipartite Vertex Cover. CoRR abs/1205.4605 (2012) - 2011
- [j6]Marja Hassinen, Joel Kaasinen, Evangelos Kranakis, Valentin Polishchuk, Jukka Suomela, Andreas Wiese:
Analysing local algorithms in location-aware quasi-unit-disk graphs. Discret. Appl. Math. 159(15): 1566-1580 (2011) - [j5]Patrik Floréen, Marja Hassinen, Joel Kaasinen, Petteri Kaski, Topi Musto, Jukka Suomela:
Local Approximability of Max-Min and Min-Max Linear Programs. Theory Comput. Syst. 49(4): 672-697 (2011) - [c20]Mika Göös, Jukka Suomela:
Locally checkable proofs. PODC 2011: 159-168 - [c19]Evangelos Kranakis, Oscar Morales Ponce, Jukka Suomela:
Planar Subgraphs without Low-Degree Nodes. WADS 2011: 583-594 - [i10]Juho Hirvonen, Jukka Suomela:
Distributed Maximal Matching: Greedy is Optimal. CoRR abs/1110.0367 (2011) - 2010
- [j4]Patrik Floréen, Petteri Kaski, Valentin Polishchuk, Jukka Suomela:
Almost Stable Matchings by Truncating the Gale-Shapley Algorithm. Algorithmica 58(1): 102-118 (2010) - [c18]Patrik Floréen, Petteri Kaski, Valentin Polishchuk, Jukka Suomela:
Brief announcement: distributed almost stable marriage. PODC 2010: 281-282 - [c17]Jukka Suomela:
Distributed algorithms for edge dominating sets. PODC 2010: 365-374 - [c16]Matti Åstrand, Jukka Suomela:
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks. SPAA 2010: 294-302 - [i9]Matti Åstrand, Valentin Polishchuk, Joel Rybicki, Jukka Suomela, Jara Uitto:
Local algorithms in (weakly) coloured graphs. CoRR abs/1002.0125 (2010)
2000 – 2009
- 2009
- [j3]Valentin Polishchuk, Jukka Suomela:
A simple local 3-approximation algorithm for vertex cover. Inf. Process. Lett. 109(12): 642-645 (2009) - [c15]Patrik Floréen, Joel Kaasinen, Petteri Kaski, Jukka Suomela:
An optimal local approximation algorithm for max-min linear programs. SPAA 2009: 260-269 - [c14]Christoph Lenzen, Jukka Suomela, Roger Wattenhofer:
Local Algorithms: Self-stabilization on Speed. SSS 2009: 17-34 - [c13]Matti Åstrand, Patrik Floréen, Valentin Polishchuk, Joel Rybicki, Jukka Suomela, Jara Uitto:
A Local 2-Approximation Algorithm for the Vertex Cover Problem. DISC 2009: 191-205 - [i8]Christoph Lenzen, Jukka Suomela, Roger Wattenhofer:
Local Algorithms: Self-Stabilization on Speed. Algorithmic Methods for Distributed Cooperative Systems 2009 - 2008
- [j2]Petteri Kaski, Aleksi Penttinen, Jukka Suomela:
Coordinating Concurrent Transmissions: A Constant-Factor Approximation of Maximum-Weight Independent Set in Local Conflict Graphs. Ad Hoc Sens. Wirel. Networks 6(3-4): 239-263 (2008) - [c12]Patrik Floréen, Marja Hassinen, Petteri Kaski, Jukka Suomela:
Tight Local Approximation Results for Max-Min Linear Programs. ALGOSENSORS 2008: 2-17 - [c11]Valentin Polishchuk, Jukka Suomela:
Optimal Backlog in the Plane. ALGOSENSORS 2008: 141-150 - [c10]Alon Efrat, Sándor P. Fekete, Poornananda R. Gaddehosur, Joseph S. B. Mitchell, Valentin Polishchuk, Jukka Suomela:
Improved Approximation Algorithms for Relay Placement. ESA 2008: 356-367 - [c9]Patrik Floréen, Petteri Kaski, Topi Musto, Jukka Suomela:
Approximating max-min linear programs with local algorithms. IPDPS 2008: 1-10 - [i7]Patrik Floréen, Marja Hassinen, Petteri Kaski, Jukka Suomela:
Tight local approximation results for max-min linear programs. CoRR abs/0804.4815 (2008) - [i6]Valentin Polishchuk, Jukka Suomela:
Optimal backlog in the plane. CoRR abs/0804.4819 (2008) - [i5]Patrik Floréen, Marja Hassinen, Petteri Kaski, Jukka Suomela:
Local approximation algorithms for a class of 0/1 max-min linear programs. CoRR abs/0806.0282 (2008) - [i4]Patrik Floréen, Joel Kaasinen, Petteri Kaski, Jukka Suomela:
An optimal local approximation algorithm for max-min linear programs. CoRR abs/0809.1489 (2008) - [i3]Valentin Polishchuk, Jukka Suomela:
A simple local 3-approximation algorithm for vertex cover. CoRR abs/0810.2175 (2008) - [i2]Patrik Floréen, Petteri Kaski, Valentin Polishchuk, Jukka Suomela:
Almost stable matchings in constant time. CoRR abs/0812.4893 (2008) - 2007
- [j1]Jukka Suomela:
Approximability of identifying codes and locating-dominating codes. Inf. Process. Lett. 103(1): 28-33 (2007) - [c8]Petteri Kaski, Aleksi Penttinen, Jukka Suomela:
Coordinating Concurrent Transmissions: A Constant-Factor Approximation of Maximum-Weight Independent Set in Local Conflict Graphs. ADHOC-NOW 2007: 74-86 - [c7]