Algorithmics for Hard Problems

@inproceedings{Hromkovic2001AlgorithmicsFH,
  title={Algorithmics for Hard Problems},
  author={J. Hromkovic},
  booktitle={Texts in Theoretical Computer Science An EATCS Series},
  year={2001}
}
  • J. Hromkovic
  • Published in
    Texts in Theoretical Computer…
    2001
  • Computer Science
120 Citations
METADOCK: A parallel metaheuristic schema for virtual screening methods
  • 20
  • Highly Influenced
Computer-aided design of bus route maps
  • 1
  • Highly Influenced
Text Summarization Model Based on Maximum Coverage Problem and its Variant
  • 105
  • Highly Influenced
  • PDF
Quantification and Selection of Ictogenic Zones in Epilepsy Surgery
  • 2
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 196 REFERENCES
Theoretical Computer Science
  • 1,005
  • PDF
Some optimal inapproximability results
  • 1,706
  • PDF
A New Algorithm for MAX-2-SAT
  • E. Hirsch
  • Mathematics, Computer Science
  • STACS
  • 2000
  • 39
A separation of determinism, Las Vegas and nondeterminism for picture recognition
  • 8
DNA computing based on splicing: universality results
  • G. Paun
  • Mathematics, Computer Science
  • Theor. Comput. Sci.
  • 2000
  • 77
  • PDF
...
1
2
3
4
5
...