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
View on Springer
wikidata.org
120 Citations
Highly Influential Citations
4
Background Citations
22
Methods Citations
13

120 Citations

Citation Type

Citation Type

Event summarization on social media stream: retrospective and prospective tweet summarization. (Synthèse d'évènement dans les médias sociaux : résumé rétrospectif et prospectif de microblogs)
  • Highly Influenced
  • PDF
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
Materialbedarfsplanung unter Berücksichtigung von Ressourcenkapazität und minimaler Losgröße durch einen RGA
A Survey on the Applications of Swarm Intelligence to Software Verification
Metaheuristics Based Optimization Technique for Protein-Ligand Docking 4618
Quantification and Selection of Ictogenic Zones in Epilepsy Surgery
  • 2
Reoptimization of minimum latency problem revisited: don’t panic when asked to revisit the route after local modifications
Control system development for an R-LEMA testing CubeSat experiment
  • 1
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 196 REFERENCES
Theoretical Computer Science
  • 1,005
  • PDF
Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem
  • 50
Parallel implementations of evolutionary algorithms
  • 11
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
A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem
  • 94
  • PDF
Approximation algorithms for the TSP with sharpened triangle inequality
  • 56
Clique Is Hard To Approximate Within
  • 300
DNA computing based on splicing: universality results
  • G. Paun
  • Mathematics, Computer Science
  • Theor. Comput. Sci.
  • 2000
  • 77
  • PDF
...
1
2
3
4
5
...