Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Experimental and Efficient Algorithms: 4th International Workshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings > Selecting the Roots of a Small System of Polynomial Equations by Tolerance Based Matching
Experimental and Efficient Algorithms: 4th International Workshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings |
Sotiris E. Nikoletseas
Springer Berlin Heidelberg
Experimental and Efficient Algorithms: 4th International Workshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings
Selecting the Roots of a Small System of Polynomial Equations by Tolerance Based Matching
Authors

H. Bekker; E. P. Braad; B. Goldengorin

ARI Id

1664827312920_3680836

Access

Not Available Free

Pages

610-613

DOI

10.1007/11427186_55

Chapter URL

https://rd.springer.com/chapter/10.1007/11427186_55

Table of Contents of Book
Showing 1 to 20 of 59 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Tα Παι δí α Παíζε ι The Interaction Between Algorithms and Game Theory
Christos H. Papadimitriou
1-3
Using an Adaptive Memory Strategy to Improve a Multistart Heuristic for Sequencing by Hybridization
Eraldo R. Fernandes; Celso C. Ribeiro
4-15
High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology
David A. Bader
16-21
The “Real” Approximation Factor of the MST Heuristic for the Minimum Energy Broadcasting
Michele Flammini; Alfredo Navarra; Stephane Perennes
22-31
Implementing Minimum Cycle Basis Algorithms
Kurt Mehlhorn; Dimitrios Michail
32-43
Rounding to an Integral Program
Refael Hassin; Danny Segev
44-54
Rectangle Covers Revisited Computationally
L. Heinrich-Litan; M. E. Lübbecke
55-66
Don’t Compare Averages
Holger Bast; Ingmar Weber
67-76
Experimental Results for Stackelberg Scheduling Strategies
A. C. Kaporis; L. M. Kirousis; E. I. Politopoulou; P. G. Spirakis
77-88
An Improved Branch-and-Bound Algorithm for the Test Cover Problem
Torsten Fahle; Karsten Tiemann
89-100
Degree-Based Treewidth Lower Bounds
Arie M. C. A. Koster; Thomas Wolle; Hans L. Bodlaender
101-112
Inferring AS Relationships: Dead End or Lively Beginning?
Xenofontas Dimitropoulos; Dmitri Krioukov; Bradley Huffaker; kc claffy; George Riley
113-125
Acceleration of Shortest Path and Constrained Shortest Path Computation
Ekkehard Köhler; Rolf H. Möhring; Heiko Schilling
126-138
A General Buffer Scheme for the Windows Scheduling Problem
Amotz Bar-Noy; Jacob Christensen; Richard E. Ladner; Tami Tamir
139-151
Implementation of Approximation Algorithms for the Multicast Congestion Problem
Qiang Lu; Hu Zhang
152-164
Frequency Assignment and Multicoloring Powers of Square and Triangular Meshes
Mustapha Kchikech; Olivier Togni
165-176
From Static Code Distribution to More Shrinkage for the Multiterminal Cut
Bram De Wachter; Alexandre Genon; Thierry Massart
177-188
Partitioning Graphs to Speed Up Dijkstra’s Algorithm
Rolf H. Möhring; Heiko Schilling; Birk Schütz; Dorothea Wagner; Thomas Willhalm
189-202
Efficient Convergence to Pure Nash Equilibria in Weighted Network Congestion Games
Panagiota N. Panagopoulou; Paul G. Spirakis
203-215
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 59 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings