Results 1 to 10 of about 1,588 (116)
Minimizing Flow Time in the Wireless Gathering Problem [PDF]
, 2008 We address the problem of efficient data gathering in a wireless network through multi-hop communication. We focus on the objective of minimizing the maximum flow time of a data packet. We prove that no polynomial time algorithm for this problem can have
Alberto Marchetti-Spaccamela +7 more
core +17 more sources
Applications of graph algorithms in GIS [PDF]
, 2010 A
Fack, Veerle, Vanhove, Stéphanie
core +2 more sources
Online Correlation Clustering [PDF]
, 2010 We study the online clustering problem where data items arrive in an online fashion. The algorithm maintains a clustering of data items into similarity classes.
Mathieu, Claire +2 more
core +4 more sources
Local Approximation Schemes for Ad Hoc and Sensor Networks [PDF]
, 2005 We present two local approaches that yield polynomial-time approximation schemes (PTAS) for the Maximum Independent Set and Minimum Dominating Set problem in unit disk graphs.
Kuhn, F. +3 more
core +4 more sources
Dominance Product and High-Dimensional Closest Pair under $L_\infty$ [PDF]
, 2017 Given a set $S$ of $n$ points in $\mathbb{R}^d$, the Closest Pair problem is to find a pair of distinct points in $S$ at minimum distance. When $d$ is constant, there are efficient algorithms that solve this problem, and fast approximate solutions for ...
Gold, Omer, Sharir, Micha
core +2 more sources
Dynamic sharing of a multiple access channel [PDF]
, 2010 In this paper we consider the mutual exclusion problem on a multiple access channel. Mutual exclusion is one of the fundamental problems in distributed computing.
Bienkowski, Marcin +3 more
core +3 more sources
Mental calculation : its place in the development of numeracy [PDF]
, 2001 The current concerns about the standards of numeracy in primary schools, as these are manifest in different official reports (HMI, 1997; DfEE, 1998), have given a revised emphasis to mental calculation.
Maclellan, Effie
core +1 more source
An Edge-Based Framework for Enumerating 3-Manifold Triangulations [PDF]
, 2014 A typical census of 3-manifolds contains all manifolds (under various constraints) that can be triangulated with at most n tetrahedra. Although censuses are useful resources for mathematicians, constructing them is difficult: the best algorithms to date ...
Burton, Benjamin A., Pettersson, William
core +3 more sources
Faster Algorithms for the Maximum Common Subtree Isomorphism Problem [PDF]
, 2016 The maximum common subtree isomorphism problem asks for the largest possible isomorphism between subtrees of two given input trees. This problem is a natural restriction of the maximum common subgraph problem, which is ${\sf NP}$-hard in general graphs ...
Droschinsky, Andre +2 more
core +2 more sources
Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems [PDF]
, 2000 We consider geometric instances of the Maximum Weighted Matching Problem (MWMP) and the Maximum Traveling Salesman Problem (MTSP) with up to 3,000,000 vertices.
A. I. Barvinok +15 more
core +2 more sources