Suchergebnisse - analysis of algorithms and problems complexity—non-numerical algorithms and problems general terms~

Analysis of Deterministic Tracking of Multiple Objects using a Binary Sensor Network

Autoren: Yann Busnel Leonardo Querzoni Roberto Baldoni et al.

Weitere Verfasser: Yann Busnel Leonardo Querzoni Roberto Baldoni et al.

Quelle: http://www.dis.uniroma1.it/~midlab/articoli/BQBBK09.pdf.

Schlagwörter: Categories and Subject Descriptors, F.2.2 [Theory of Computation, Analysis of Algorithms and Problem Complexity—Non-numerical Algorithms and Problems General Terms, Algorithms, Theory Additional Key Words and Phrases, Binary Sensor Network, Distributed algorithm, Impossibility and Characterization, Passive Trajectory Tracking

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.1691; http://www.dis.uniroma1.it/~midlab/articoli/BQBBK09.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.1691
http://www.dis.uniroma1.it/~midlab/articoli/BQBBK09.pdf

Matching Algorithmic Bounds for Finding a Brouwer Fixed Point.

Autoren: XI CHEN XIAOTIE DENG

Quelle: Journal of the ACM; Jul2008, Vol. 55 Issue 3, p1-26, 26p, 1 Diagram, 8 Charts

Schlagwörter: BOUNDARY value problems, ALGORITHMS, NONLINEAR boundary value problems, INITIAL value problems, COMPLEX variables, MATHEMATICAL physics, FIXED point theory, NONLINEAR operators

An Approximation Algorithm for Scheduling Malleable Tasks under General Precedence Constraints.

Autoren: Jansen, Klaus Zhang, Hu

Quelle: ACM Transactions on Algorithms; 2006, Vol. 2 Issue 3, p416-434, 19p

Schlagwörter: ALGORITHMS, COMPUTATIONAL mathematics, ALGEBRA, COMPUTER programming, MATHEMATICAL analysis, INFORMATION technology

Faster Fixed Parameter Tractable Algorithms for Finding Feedback Vertex Sets.

Autoren: Raman, Venkatesh Saurabh, Saket Subramanian, C. R.

Quelle: ACM Transactions on Algorithms; 2006, Vol. 2 Issue 3, p403-415, 13p

Schlagwörter: ACYCLIC model, HOMOLOGICAL algebra, ALGEBRAIC topology, ALGORITHMS, COMPUTATIONAL mathematics, MATHEMATICAL programming

Secure Multiparty Computation of Approximations.

Autoren: Feigenbaum, Joan Ishai, Yuval Malkin, Tal et al.

Quelle: ACM Transactions on Algorithms; 2006, Vol. 2 Issue 3, p435-472, 38p

Schlagwörter: ALGORITHMS, MATHEMATICAL analysis, APPROXIMATION theory, FUNCTIONAL analysis, MATHEMATICS, ALGEBRA

Dependent Rounding and Its Applications to Approximation Algorithms.

Autoren: Gandhi, Rajiv Khuller, Samir Parthasarathy, Srinivasan et al.

Quelle: Journal of the ACM; May2006, Vol. 53 Issue 3, p324-360, 37p

Schlagwörter: ALGORITHMS, APPROXIMATION theory, BIPARTITE graphs, GRAPH theory, VECTOR analysis

Subexponential Parameterized Algorithms on Bounded-Genus Graphs and H-Minor-Free Graphs.

Autoren: Demaine, Erik D. Fomin, Fedor V. Hajiaghayi, Mohammadtaghi et al.

Quelle: Journal of the ACM; Nov2005, Vol. 52 Issue 6, p866-893, 28p

Schlagwörter: ALGORITHMS, GRAPHIC methods, GRAPH theory, ALGEBRA, COMBINATORICS

A Unified Approach to Scheduling on Unrelated Parallel Machines.

Autoren: KUMAR, V. S. ANIL MARATHE, MADHAV V. PARTHASARATHY, SRINIVASAN et al.

Quelle: Journal of the ACM; Aug2009, Vol. 56 Issue 5, p28-28:31, 31p, 1 Chart

Schlagwörter: CONVEX programming, PRODUCTION scheduling, LINEAR programming, VECTOR analysis, PARALLEL algorithms, PARALLEL computers, PARALLEL programs (Computer programs), PARALLEL processing, AFFINITY scheduling for parallel processing

Efficient Algorithms for the 2-Gathering Problem.

Autoren: Shalita, Alon Zwick, Uri

Quelle: ACM Transactions on Algorithms; 2010, Vol. 6 Issue 2, p34:1-34:20, 20p, 5 Diagrams, 4 Charts

Schlagwörter: ALGORITHMS, NUMERICAL analysis, GRAPH theory, BIPARTITE graphs, DIRECTED graphs, GRAPHIC methods

Optimality of an Algorithm Solving the Bottleneck Tower of Hanoi Problem.

Autoren: DINITZ, YEFIM SOLOMON, SHAY

Quelle: ACM Transactions on Algorithms; 2008, Vol. 4 Issue 3, p25-25:9, 9p, 3 Diagrams

Schlagwörter: ALGORITHMS, PUZZLES, PROBLEM solving, MATHEMATICS, THEORY

Simultaneous Source Location.

Autoren: Andreev, Konstantin Garrod, Charles Golovin, Daniel et al.

Quelle: ACM Transactions on Algorithms; 2009, Vol. 6 Issue 1, p16:1-16:17, 17p, 2 Diagrams, 3 Charts

Schlagwörter: ALGORITHMS, GRAPHIC methods, GRAPH theory, DIMENSIONAL analysis, APPROXIMATION theory, FUNCTIONAL analysis

Approximating Connectivity Augmentation Problems.

Autoren: Nutova, Zeev

Quelle: ACM Transactions on Algorithms; 2009, Vol. 6 Issue 1, p5:1-5:19, 19p

Schlagwörter: APPROXIMATION theory, FUNCTIONAL analysis, ALGORITHMS, RATIO & proportion, POLYNOMIALS, ALGEBRA

New Hardness Results for Congestion Minimization and Machine Scheduling.

Autoren: Chuzhoy, Julia Naor, Joseph (Seffi)

Quelle: Journal of the ACM; Sep2006, Vol. 53 Issue 5, p707-721, 15p

Schlagwörter: COMPUTER networks, BOTTLENECKS (Manufacturing), COMPUTER scheduling, DIRECTED graphs, MATHEMATICAL analysis

Connectivity-based localization of large scale sensor networks with complex shape

Autoren: Sol Lederer Yue Wang Jie Gao et al.

Weitere Verfasser: Sol Lederer Yue Wang Jie Gao et al.

Quelle: http://www.cs.sunysb.edu/~jgao/paper/layout.pdf.

Schlagwörter: General Terms, Algorithms, Theory Additional Key Words and Phrases, Sensor Networks, Combinatorial Delaunay Complex, Embedding, Localization, Graph Rigidity

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.8379; http://www.cs.sunysb.edu/~jgao/paper/layout.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.8379
http://www.cs.sunysb.edu/~jgao/paper/layout.pdf

A Better Approximation Ratio for the Vertex Cover Problem.

Autoren: Karakostas, George

Quelle: ACM Transactions on Algorithms; 2009, Vol. 5 Issue 4, p41-41:8, 8p

Schlagwörter: POLYNOMIALS, FINANCIAL ratios, EQUALITY, ALGEBRA, ALGORITHMS, NETWORK analysis (Planning), APPROXIMATION theory, BIVECTORS

Algorithms for Capacitated Rectangle Stabbing and Lot Sizing with Joint Set-Up Costs.

Autoren: EVEN, GUY LEVI, RETSEF RAWITZ, DROR et al.

Quelle: ACM Transactions on Algorithms; 2008, Vol. 4 Issue 3, p34-34:17, 17p, 3 Diagrams

Schlagwörter: ALGORITHMS, RECTANGLES, SETUP costs, APPROXIMATION theory, COMBINATORICS, MATHEMATICAL analysis

Max-Coloring and Online Coloring with Bandwidths on Interval Graphs.

Autoren: PEMMARAJU, SRIRAM V. RAMAN, RAJIV VARADARAJAN, KASTURI

Quelle: ACM Transactions on Algorithms; 2011, Vol. 7 Issue 3, p35-35:21, 21p

Schlagwörter: GRAPH coloring, BANDWIDTHS, COMPUTER memory management, COMPUTER operating systems, INFORMATION retrieval, GRAPH theory, APPROXIMATION algorithms, BUFFER storage (Computer science)

Determining Approximate Shortest Paths on Weighted Polyhedral Surfaces.

Autoren: Aleksandrov, L. Maheshwari, A. Sack, J.-R.

Quelle: Journal of the ACM; Jan2005, Vol. 52 Issue 1, p25-53, 29p, 10 Diagrams, 2 Charts

Schlagwörter: ALGORITHMS, APPROXIMATION theory, POLYHEDRAL functions, GEOMETRY, POLYHEDRA

Polynomial-Time Data Reduction for DOMINATING SET.

Autoren: Alber, Jochen Fellows, Michael R. Niedermeier, Rolf

Quelle: Journal of the ACM; May2004, Vol. 51 Issue 3, p363-384, 22p

Schlagwörter: NP-complete problems, COMPUTATIONAL complexity, GRAPH theory, DATA reduction, TOPOLOGY, COMBINATORIAL optimization, MATHEMATICAL optimization

Combinatorial Bounds via Measure and Conquer: Bounding Minimal Dominating Sets and Applications.

Autoren: Fomin, Fedor V. Grandoni, Fabrizio Pyatkin, Artem V. et al.

Quelle: ACM Transactions on Algorithms; 2008, Vol. 5 Issue 1, p9-9:17, 17p, 1 Chart

Schlagwörter: GRAPH theory, COMBINATORICS, MATHEMATICAL analysis, COMPUTATIONAL mathematics, GRAPH algorithms, ALGORITHMS