×

zbMATH — the first resource for mathematics

Found 82 Documents (Results 1–82)

Hits per Page
100
Display Format
MathJax
Result Sorting
Newest 1st
Il’ev, Victor; Il’eva, Svetlana; Morshinin, Alexander
An approximation algorithm for a semi-supervised graph clustering problem. (English) Zbl 07315668
Kochetov, Yury (ed.) et al., Mathematical optimization theory and operations research. 19th international conference, MOTOR 2020, Novosibirsk, Russia, July 6–10, 2020. Revised selected papers. Cham: Springer (ISBN 978-3-030-58656-0/pbk; 978-3-030-58657-7/ebook). Communications in Computer and Information Science 1275, 23-29 (2020).
MSC:  90C 68 91
PDF BibTeX XML Cite
\textit{V. Il'ev} et al., Commun. Comput. Inf. Sci. 1275, 23--29 (2020; Zbl 07315668)
Full Text: DOI
Il’ev, Victor; Il’eva, Svetlana; Morshinin, Alexander
A 2-approximation algorithm for the graph 2-clustering problem. (English) Zbl 1437.90137
Khachay, Michael (ed.) et al., Mathematical optimization theory and operations research. 18th international conference, MOTOR 2019, Ekaterinburg, Russia, July 8–12, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11548, 295-308 (2019).
MSC:  90C27 90B06 90C59
PDF BibTeX XML Cite
\textit{V. Il'ev} et al., Lect. Notes Comput. Sci. 11548, 295--308 (2019; Zbl 1437.90137)
Full Text: DOI
Gusmeroli, Nicoló
Machine scheduling to minimize weighted completion times. The use of the \(\alpha\)-point. (English) Zbl 1395.90003
SpringerBriefs in Mathematics. Cham: Springer (ISBN 978-3-319-77527-2/pbk; 978-3-319-77528-9/ebook). xi, 53 p. (2018).
Reviewer: Svetlana A. Kravchenko (Minsk)
MSC:  90-02 90B35 90C27 90C59 68Q25 68M20 68W20 68W25 68W40
PDF BibTeX XML Cite
\textit{N. Gusmeroli}, Machine scheduling to minimize weighted completion times. The use of the \(\alpha\)-point. Cham: Springer (2018; Zbl 1395.90003)
Full Text: DOI
Il’ev, Victor; Il’eva, Svetlana; Kononov, Alexander
Short survey on graph correlation clustering with minimization criteria. (English) Zbl 1380.68314
Kochetov, Yury (ed.) et al., Discrete optimization and operations research. 9th international conference, DOOR 2016, Vladivostok, Russia, September 19–23, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-44913-5/pbk; 978-3-319-44914-2/ebook). Lecture Notes in Computer Science 9869, 25-36 (2016).
MSC:  68R10 68Q25 68W25
PDF BibTeX XML Cite
\textit{V. Il'ev} et al., Lect. Notes Comput. Sci. 9869, 25--36 (2016; Zbl 1380.68314)
Full Text: DOI
Il’ev, V. P.; Il’eva, S. D.; Navrotskaya, A. A.
Approximate solution of the \(p\)-median minimization problem. (English. Russian original) Zbl 1362.90324
Comput. Math. Math. Phys. 56, No. 9, 1591-1597 (2016); translation from Zh. Vychisl. Mat. Mat. Fiz. 56, No. 9, 1614-1621 (2016).
MSC:  90C27 90C59
PDF BibTeX XML Cite
\textit{V. P. Il'ev} et al., Comput. Math. Math. Phys. 56, No. 9, 1591--1597 (2016; Zbl 1362.90324); translation from Zh. Vychisl. Mat. Mat. Fiz. 56, No. 9, 1614--1621 (2016)
Full Text: DOI
Gimadi, E. Kh.; Kel’manov, A. V.; Pyatkin, A. V.; Khachai, M. Yu.
Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph. (English. Russian original) Zbl 1319.05125
Proc. Steklov Inst. Math. 289, Suppl. 1, S88-S101 (2015); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 20, No. 2, 99-112 (2014).
MSC:  05C85 90C60 90C35
PDF BibTeX XML Cite
\textit{E. Kh. Gimadi} et al., Proc. Steklov Inst. Math. 289, S88--S101 (2015; Zbl 1319.05125); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 20, No. 2, 99--112 (2014)
Full Text: DOI
Megow, Nicole; Mestre, Julian
Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints (extended abstract). (English) Zbl 1361.68100
Proceedings of the 4th conference on innovations in theoretical computer science, ITCS’13, Berkeley, CA, USA, January 9–12, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1859-4). 495-503 (2013).
MSC:  68Q17 68M20
PDF BibTeX XML Cite
\textit{N. Megow} and \textit{J. Mestre}, in: Proceedings of the 4th conference on innovations in theoretical computer science, ITCS'13, Berkeley, CA, USA, January 9--12, 2013. New York, NY: Association for Computing Machinery (ACM). 495--503 (2013; Zbl 1361.68100)
Full Text: DOI
Turon, Aaron Joseph; Wand, Mitchell
A separation logic for refining concurrent objects. (English) Zbl 1284.68207
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL ’11, Austin, TX, USA, January 26–28, 2011. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0490-0). 247-258 (2011).
MSC:  68N30 68N19 68Q85 68M20
PDF BibTeX XML Cite
\textit{A. J. Turon} and \textit{M. Wand}, in: Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL '11, Austin, TX, USA, January 26--28, 2011. New York, NY: Association for Computing Machinery (ACM). 247--258 (2011; Zbl 1284.68207)
Full Text: DOI
Recalde, Diego; Rutten, Cyriel; Schuurman, Petra; Vredeveld, Tjark
Local search performance guarantees for restricted related parallel machine scheduling. (English) Zbl 1283.68114
López-Ortiz, Alejandro (ed.), LATIN 2010: Theoretical informatics. 9th Latin American symposium, Oaxaca, Mexico, April 19–23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-12199-9/pbk). Lecture Notes in Computer Science 6034, 108-119 (2010).
MSC:  68M20 68T20 90B35
PDF BibTeX XML Cite
\textit{D. Recalde} et al., Lect. Notes Comput. Sci. 6034, 108--119 (2010; Zbl 1283.68114)
Full Text: DOI
Glazkov, Yury; Baburin, Alexei; Gimadi, Edward; Della Croce, Federico; Vangelis, Paschos
Approximation algorithms for 2-peripathetic salesman problem with edge weights 1 and 2. (English) Zbl 1278.90417
Grüttmüller, M. (ed.) et al., ODSA 2006. Conference on optimal discrete structures and algorithms, Rostock, Germany, September 4–6, 2006. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 27, 35-36 (2006).
MSC:  90C35
PDF BibTeX XML Cite
\textit{Y. Glazkov} et al., Electron. Notes Discrete Math. 27, 35--36 (2006; Zbl 1278.90417)
Full Text: DOI
Brueggemann, Tobias; Hurink, Johann L.; Vredeveld, Tjark; Woeginger, Gerhard J.
Performance of a very large-scale neighborhood for minimizing makespan on parallel machines. (English) Zbl 1134.68321
Faigle, U. (ed.) et al., CTW2006. Cologne-Twente Workshop on graphs and combinatorial optimization, Lambrecht, Germany, June 5–9, 2006. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 25, 29-33 (2006).
MSC:  68M20 68W10
PDF BibTeX XML Cite
\textit{T. Brueggemann} et al., Electron. Notes Discrete Math. 25, 29--33 (2006; Zbl 1134.68321)
Full Text: DOI
Woeginger, Gerhard J.
Formulations, relaxations, approximations, and gaps in the world of scheduling. (English) Zbl 1079.90545
Kendall, Graham (ed.) et al., Multidisciplinary scheduling: theory and applications. 1st international conference, MISTA ’03, Nottingham, UK, 13–15 August 2003. Selected papers. New York, NY: Springer (ISBN 0-387-25266-5/hbk). 19-36 (2005).
MSC:  90B35 90C59 68W25
PDF BibTeX XML Cite
\textit{G. J. Woeginger}, in: Multidisciplinary scheduling: theory and applications. 1st international conference, MISTA '03, Nottingham, UK, 13--15 August 2003. Selected papers. New York, NY: Springer. 19--36 (2005; Zbl 1079.90545)
Choi, Jin Seek; Bae, Bum Sik; Lee, Hyeong Ho; Lee, Hyeung Sub
Round-robin scheduling algorithm with multiple distributed windows. (English) Zbl 1047.68700
Chong, Ilyoung (ed.), Information networking. Wired communications and management. International conference, ICOIN 2002, Cheju Island, Korea, January 30 - February 1, 2002. Revised papers, part 2. Berlin: Springer (ISBN 3-540-44255-3). Lect. Notes Comput. Sci. 2344, 814-819 (2002).
MSC:  68U99 68M10 68M20
PDF BibTeX XML Cite
\textit{J. S. Choi} et al., Lect. Notes Comput. Sci. 2344, 814--819 (2002; Zbl 1047.68700)
Full Text: Link
Lepere, R.; Rapine, C.
An asymptotic \(\mathcal{O}(\ln\rho/\ln\ln\rho)\)-approximation algorithm for the scheduling problem with duplication on large communication delay graphs. (English) Zbl 1054.68832
Alt, Helmut (ed.) et al., STACS 2002. 19th annual symposium on theoretical aspects of computer science. Antibes - Juan les Pins, France, March 14–16, 2002. Proceedings. Berlin: Springer (ISBN 3-540-43283-3). Lect. Notes Comput. Sci. 2285, 154-165 (2002).
MSC:  68W25 68M20 90B35
PDF BibTeX XML Cite
\textit{R. Lepere} and \textit{C. Rapine}, Lect. Notes Comput. Sci. 2285, 154--165 (2002; Zbl 1054.68832)
Full Text: Link
Fekete, Sándor P.; Khuller, Samir; Klemmstein, Monika; Raghavachari, Balaji; Young, Neal
A network-flow technique for finding low-weight bounded-degree spanning trees. (English) Zbl 1415.90099
Cunningham, W. H. (ed.) et al., Integer programming and combinatorial optimization. 5th international IPCO conference, Vancouver, Canada, June 3–5, 1996. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1084, 105-117 (1996).
MSC:  90C27 90C35
PDF BibTeX XML Cite
\textit{S. P. Fekete} et al., Lect. Notes Comput. Sci. 1084, 105--117 (1996; Zbl 1415.90099)
Full Text: DOI

Filter Results by …

Document Type
Reviewing State
all top 5
Author
all top 5
Serial
all top 5
Year of Publication
all top 3
Classification
all top 3
Software