Conference
Scandinavian Workshop on Algorithm Theory
About: Scandinavian Workshop on Algorithm Theory is an academic conference. The conference publishes majorly in the area(s): Time complexity & Approximation algorithm. Over the lifetime, 652 publications have been published by the conference receiving 10848 citations.
Topics: Time complexity, Approximation algorithm, Computer science, Upper and lower bounds, Chordal graph
Papers published on a yearly basis
Papers
8 Jul 2004
TL;DR: This paper considers the problems of generating all maximal (bipartite) cliques in a given graph G=(V,E) with n vertices and m edges and proposes two algorithms for enumerating all maximal cliques.
Abstract: In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G=(V,E) with n vertices and m edges. We propose two algorithms for enumerating all maximal cliques. One runs with O(M(n)) time delay and in O(n 2) space and the other runs with O(Δ4) time delay and in O(n+m) space, where Δ denotes the maximum degree of G, M(n) denotes the time needed to multiply two n × n matrices, and the latter one requires O(nm) time as a preprocessing.
492 citations
1 Jul 1990
TL;DR: An approximation algorithm for the maximum independent set problem is given, improving the best performance guarantee known to n/(log n)2, and this can be combined into a surprisingly strong simultaneous performance guarantee for the clique and coloring problems.
Abstract: An approximation algorithm for the maximum independent set problem is given, improving the best performance guarantee known to \({\cal O}\)(n/(log n)2). We also obtain the same performance guarantee for graph coloring. The results can be combined into a surprisingly strong simultaneous performance guarantee for the clique and coloring problems.
219 citations
3 Jan 1988
182 citations
5 Jul 2000
TL;DR: In this paper, the authors considered the hospital/residents problem with ties in the preference lists and presented a linear-time algorithm for the problem under the strongest of these criteria, called super-stability.
Abstract: The hospitals/residents problem is an extensively-studied many-one stable matching problem. Here, we consider the hospitals/ residents problem where ties are allowed in the preference lists. In this extended setting, a number of natural definitions for a stable matching arise. We present the first linear-time algorithm for the problem under the strongest of these criteria, so-called super-stability. Our new results have applications to large-scale matching schemes, such as the National Resident Matching Program in the US, and similar schemes elsewhere.
153 citations
8 Jul 1992
TL;DR: It is shown that optimality to within a multiplicative factor close to one can be achieved for the problems of Gauss-Jordan elimination and sorting, by transportable algorithms that can be applied for a wide range of values of the parameters p, g, and L.
Abstract: We describe a methodology for constructing parallel algorithms that are transportable among parallel computers having different numbers of processors, different bandwidths of interprocessor communication and different periodicity of global synchronisation. We do this for the bulk-synchronous parallel (BSP) model, which abstracts the characteristics of a parallel machine into three numerical parameters p, g, and L, corresponding to processors, bandwidth, and periodicity respectively. The model differentiates memory that is local to a processor from that which is not, but, for the sake of universality, does not differentiate network proximity. The advantages of this model in supporting shared memory or PRAM style programming have been treated elsewhere. Here we emphasise the viability of an alternative direct style of programming where, for the sake of efficiency the programmer retains control of memory allocation. We show that optimality to within a multiplicative factor close to one can be achieved for the problems of Gauss-Jordan elimination and sorting, by transportable algorithms that can be applied for a wide range of values of the parameters p, g, and L. We also give some simulation results for PRAMs on the BSP to identify the level of slack at which corresponding efficiencies can be approached by shared memory simulations, provided the bandwidth parameter g is good enough.
134 citations
Performance Metrics
| Year | Papers |
|---|---|
| 2023 | 2 |
| 2022 | 25 |
| 2020 | 26 |
| 2019 | 1 |
| 2018 | 27 |
| 2017 | 1 |