Can Greedy-like Heuristics Be Useful for Solving the Weighted Orthogonal Art Gallery Problem Under Regular Grid Discretization?
Naslov
                                Can Greedy-like Heuristics Be Useful for Solving the Weighted Orthogonal Art Gallery Problem Under Regular Grid Discretization?            
                            Identifikator
                                /unibl/sci/idNaucniRad:29534            
                                                        
                            Tip
                                Pronađite slične unoseAcademic Article            
                                                        
                            Datum
                                Pronađite slične unose2021-12            
                            Bibliografski citat
                                M. Predojević, M. Đukanović, M. Grbić, D. Matić, Can Greedy-like Heuristics Be Useful for Solving the Weighted Orthogonal Art Gallery Problem Under Regular Grid Discretization?, International Journal of Electrical Engineering and Computing , Vol. 5, No. 2, pp. 77 - 85, Dec, 2021            
                            Početna stranica
                                77            
                            Krajnja stranica
                                85            
                            Je dio
                                International Journal of Electrical Engineering and Computing            
                                                        
                                2566-3682            
                            Veza
Lista autora
Position: 24432 (133 views)
