Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Woeginger, Gerhard J. Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 3 of 3 reviews    
  The (weighted) metric dimension of graphs: hard and easy cases
Epstein L., Levin A., Woeginger G. Algorithmica 72(4): 1130-1171, 2015.  Type: Article

Metric dimension (MD) optimization algorithms require computation in such areas as network verification, mastermind games, metric and digital geometry, image digitization, robot navigation, drug discovery, and combinatorics problems. T...
...
Aug 31 2015  
  All-norm approximation algorithms
Azar Y., Epstein L., Richter Y., Woeginger G. Journal of Algorithms 52(2): 120-133, 2004.  Type: Article

In optimization problems, especially in scheduling problems for different measures, there might be different optimal solutions. In this work, the authors introduce the concept of an all-norm ρ-approximation algorithm for the pr...
...
Nov 11 2004  
  A faster off-line algorithm for the TCP acknowledgement problem
Noga J., Seiden S., Woeginger G. Information Processing Letters 81(2): 71-73, 2002.  Type: Article

Transmission control protocol (TCP) is a popular Internet protocol. When two computers connect to each other to exchange data, the speed and reliability of communication is important. This paper proposes a new, faster, off-line algori...
...
Mar 13 2003  

   
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy